./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 02:01:08,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 02:01:08,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 02:01:08,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 02:01:08,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 02:01:08,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 02:01:08,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 02:01:08,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 02:01:08,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 02:01:08,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 02:01:08,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 02:01:08,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 02:01:08,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 02:01:08,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 02:01:08,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 02:01:08,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 02:01:08,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 02:01:08,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 02:01:08,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 02:01:08,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 02:01:08,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 02:01:08,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 02:01:08,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 02:01:08,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 02:01:08,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 02:01:08,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 02:01:08,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 02:01:08,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 02:01:08,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 02:01:08,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 02:01:08,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 02:01:08,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 02:01:08,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 02:01:08,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 02:01:08,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 02:01:08,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 02:01:08,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 02:01:08,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 02:01:08,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 02:01:08,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 02:01:08,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 02:01:08,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 02:01:09,027 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 02:01:09,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 02:01:09,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 02:01:09,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 02:01:09,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 02:01:09,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 02:01:09,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 02:01:09,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 02:01:09,030 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 02:01:09,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 02:01:09,031 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 02:01:09,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 02:01:09,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 02:01:09,033 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 02:01:09,033 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 02:01:09,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 02:01:09,033 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 02:01:09,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 02:01:09,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 02:01:09,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 02:01:09,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 02:01:09,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:01:09,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 02:01:09,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 02:01:09,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 02:01:09,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 02:01:09,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 02:01:09,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 02:01:09,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 02:01:09,036 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 02:01:09,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 02:01:09,036 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 02:01:09,037 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! data-race) ) 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 02:01:09,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 02:01:09,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 02:01:09,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 02:01:09,380 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 02:01:09,381 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 02:01:09,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-29 02:01:10,460 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 02:01:10,778 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 02:01:10,780 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-29 02:01:10,799 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25d99ebc/f85e7d2dd1624cfa881833663a2ce611/FLAGdffdc4fe0 [2023-08-29 02:01:10,812 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25d99ebc/f85e7d2dd1624cfa881833663a2ce611 [2023-08-29 02:01:10,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 02:01:10,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 02:01:10,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 02:01:10,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 02:01:10,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 02:01:10,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:01:10" (1/1) ... [2023-08-29 02:01:10,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f03cfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:10, skipping insertion in model container [2023-08-29 02:01:10,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 02:01:10" (1/1) ... [2023-08-29 02:01:10,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 02:01:10,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 02:01:11,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:01:11,329 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 02:01:11,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 02:01:11,476 INFO L208 MainTranslator]: Completed translation [2023-08-29 02:01:11,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11 WrapperNode [2023-08-29 02:01:11,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 02:01:11,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 02:01:11,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 02:01:11,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 02:01:11,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,547 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2023-08-29 02:01:11,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 02:01:11,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 02:01:11,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 02:01:11,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 02:01:11,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,590 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 02:01:11,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 02:01:11,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 02:01:11,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 02:01:11,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (1/1) ... [2023-08-29 02:01:11,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 02:01:11,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:01:11,632 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) [2023-08-29 02:01:11,645 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 [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 02:01:11,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 02:01:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 02:01:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 02:01:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 02:01:11,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 02:01:11,675 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 02:01:11,859 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 02:01:11,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 02:01:12,118 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 02:01:12,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 02:01:12,125 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-29 02:01:12,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:01:12 BoogieIcfgContainer [2023-08-29 02:01:12,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 02:01:12,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 02:01:12,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 02:01:12,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 02:01:12,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 02:01:10" (1/3) ... [2023-08-29 02:01:12,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5472719b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:01:12, skipping insertion in model container [2023-08-29 02:01:12,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 02:01:11" (2/3) ... [2023-08-29 02:01:12,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5472719b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 02:01:12, skipping insertion in model container [2023-08-29 02:01:12,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 02:01:12" (3/3) ... [2023-08-29 02:01:12,133 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2023-08-29 02:01:12,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 02:01:12,148 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 02:01:12,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-29 02:01:12,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 02:01:12,196 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 02:01:12,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 201 flow [2023-08-29 02:01:12,260 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-29 02:01:12,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:01:12,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 4/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-29 02:01:12,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 98 transitions, 201 flow [2023-08-29 02:01:12,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 97 transitions, 197 flow [2023-08-29 02:01:12,271 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 02:01:12,279 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-29 02:01:12,282 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-29 02:01:12,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 97 transitions, 197 flow [2023-08-29 02:01:12,303 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-29 02:01:12,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:01:12,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 4/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-29 02:01:12,306 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-29 02:01:13,963 INFO L134 LiptonReduction]: Checked pairs total: 7607 [2023-08-29 02:01:13,963 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-29 02:01:13,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 02:01:13,980 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52e5c253, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 02:01:13,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-29 02:01:13,985 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2023-08-29 02:01:13,985 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:01:13,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:13,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:13,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:13,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1950365207, now seen corresponding path program 1 times [2023-08-29 02:01:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020346660] [2023-08-29 02:01:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:14,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020346660] [2023-08-29 02:01:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020346660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 02:01:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578205560] [2023-08-29 02:01:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 02:01:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 02:01:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 02:01:14,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 166 [2023-08-29 02:01:14,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:14,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 166 [2023-08-29 02:01:14,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:14,374 INFO L130 PetriNetUnfolder]: 31/148 cut-off events. [2023-08-29 02:01:14,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:01:14,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 148 events. 31/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 539 event pairs, 30 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 214. Up to 76 conditions per place. [2023-08-29 02:01:14,378 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-29 02:01:14,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 109 flow [2023-08-29 02:01:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 02:01:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 02:01:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-29 02:01:14,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763052208835341 [2023-08-29 02:01:14,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-29 02:01:14,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-29 02:01:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:14,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-29 02:01:14,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,417 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 287 transitions. [2023-08-29 02:01:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 109 flow [2023-08-29 02:01:14,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 02:01:14,421 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-29 02:01:14,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-29 02:01:14,426 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-29 02:01:14,427 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-29 02:01:14,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:14,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:14,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 02:01:14,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:14,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1263490996, now seen corresponding path program 1 times [2023-08-29 02:01:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42066797] [2023-08-29 02:01:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42066797] [2023-08-29 02:01:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42066797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:01:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646491448] [2023-08-29 02:01:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:14,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:01:14,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:01:14,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 02:01:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:14,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 02:01:14,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:01:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:14,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:01:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646491448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:01:14,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:01:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 02:01:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30272640] [2023-08-29 02:01:14,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:01:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 02:01:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 02:01:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 02:01:14,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-29 02:01:14,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:14,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-29 02:01:14,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:14,756 INFO L130 PetriNetUnfolder]: 31/151 cut-off events. [2023-08-29 02:01:14,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 02:01:14,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 151 events. 31/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 541 event pairs, 30 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 233. Up to 76 conditions per place. [2023-08-29 02:01:14,767 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-29 02:01:14,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 136 flow [2023-08-29 02:01:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:01:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:01:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2023-08-29 02:01:14,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582329317269076 [2023-08-29 02:01:14,785 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 556 transitions. [2023-08-29 02:01:14,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 556 transitions. [2023-08-29 02:01:14,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:14,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 556 transitions. [2023-08-29 02:01:14,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,790 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,791 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 556 transitions. [2023-08-29 02:01:14,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 136 flow [2023-08-29 02:01:14,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 02:01:14,792 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-29 02:01:14,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-29 02:01:14,793 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-29 02:01:14,793 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-29 02:01:14,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:14,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:14,794 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:14,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 02:01:15,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:15,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:15,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1338651991, now seen corresponding path program 2 times [2023-08-29 02:01:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898397573] [2023-08-29 02:01:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 02:01:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:15,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898397573] [2023-08-29 02:01:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898397573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 02:01:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104897130] [2023-08-29 02:01:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:15,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:01:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:01:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:01:15,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 166 [2023-08-29 02:01:15,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:15,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:15,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 166 [2023-08-29 02:01:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:15,753 INFO L130 PetriNetUnfolder]: 148/371 cut-off events. [2023-08-29 02:01:15,754 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 02:01:15,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 371 events. 148/371 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1593 event pairs, 74 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 695. Up to 250 conditions per place. [2023-08-29 02:01:15,759 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 50 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2023-08-29 02:01:15,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 344 flow [2023-08-29 02:01:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:01:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:01:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2023-08-29 02:01:15,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271084337349398 [2023-08-29 02:01:15,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2023-08-29 02:01:15,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2023-08-29 02:01:15,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:15,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2023-08-29 02:01:15,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:15,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:15,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:15,769 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 525 transitions. [2023-08-29 02:01:15,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 344 flow [2023-08-29 02:01:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 330 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 02:01:15,772 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-29 02:01:15,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-29 02:01:15,773 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-29 02:01:15,774 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-29 02:01:15,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:15,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:15,774 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:15,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 02:01:15,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:15,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2110106231, now seen corresponding path program 1 times [2023-08-29 02:01:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307920460] [2023-08-29 02:01:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 02:01:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307920460] [2023-08-29 02:01:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307920460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 02:01:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664875409] [2023-08-29 02:01:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:16,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:01:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:01:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:01:16,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 166 [2023-08-29 02:01:16,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:16,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 166 [2023-08-29 02:01:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:16,369 INFO L130 PetriNetUnfolder]: 188/465 cut-off events. [2023-08-29 02:01:16,370 INFO L131 PetriNetUnfolder]: For 133/137 co-relation queries the response was YES. [2023-08-29 02:01:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 465 events. 188/465 cut-off events. For 133/137 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2178 event pairs, 61 based on Foata normal form. 3/459 useless extension candidates. Maximal degree in co-relation 1074. Up to 299 conditions per place. [2023-08-29 02:01:16,372 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 65 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2023-08-29 02:01:16,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 546 flow [2023-08-29 02:01:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:01:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:01:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2023-08-29 02:01:16,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401606425702812 [2023-08-29 02:01:16,375 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 538 transitions. [2023-08-29 02:01:16,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 538 transitions. [2023-08-29 02:01:16,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:16,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 538 transitions. [2023-08-29 02:01:16,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,379 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,379 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 538 transitions. [2023-08-29 02:01:16,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 546 flow [2023-08-29 02:01:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 546 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:16,384 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-29 02:01:16,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-29 02:01:16,385 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-29 02:01:16,385 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-29 02:01:16,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:16,386 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 02:01:16,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:16,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1793987561, now seen corresponding path program 1 times [2023-08-29 02:01:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443132701] [2023-08-29 02:01:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443132701] [2023-08-29 02:01:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443132701] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:01:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951891638] [2023-08-29 02:01:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:01:16,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:01:16,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 02:01:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:16,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 02:01:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:01:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:16,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:01:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951891638] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 02:01:16,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 02:01:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 02:01:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451558537] [2023-08-29 02:01:16,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 02:01:16,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 02:01:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 02:01:16,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 02:01:16,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-29 02:01:16,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 438 flow. Second operand has 13 states, 13 states have (on average 90.46153846153847) internal successors, (1176), 13 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:16,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-29 02:01:16,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:16,779 INFO L130 PetriNetUnfolder]: 116/356 cut-off events. [2023-08-29 02:01:16,780 INFO L131 PetriNetUnfolder]: For 271/274 co-relation queries the response was YES. [2023-08-29 02:01:16,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 356 events. 116/356 cut-off events. For 271/274 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1732 event pairs, 38 based on Foata normal form. 7/356 useless extension candidates. Maximal degree in co-relation 882. Up to 139 conditions per place. [2023-08-29 02:01:16,783 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 21 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-29 02:01:16,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 538 flow [2023-08-29 02:01:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 02:01:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 02:01:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1099 transitions. [2023-08-29 02:01:16,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517068273092369 [2023-08-29 02:01:16,787 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1099 transitions. [2023-08-29 02:01:16,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1099 transitions. [2023-08-29 02:01:16,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:16,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1099 transitions. [2023-08-29 02:01:16,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.58333333333333) internal successors, (1099), 12 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,795 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,795 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1099 transitions. [2023-08-29 02:01:16,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 538 flow [2023-08-29 02:01:16,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:16,802 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-29 02:01:16,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-29 02:01:16,804 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-29 02:01:16,804 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-29 02:01:16,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.46153846153847) internal successors, (1176), 13 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:16,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:16,805 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:16,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 02:01:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:17,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:17,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 46610167, now seen corresponding path program 2 times [2023-08-29 02:01:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190281514] [2023-08-29 02:01:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190281514] [2023-08-29 02:01:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190281514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 02:01:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409463022] [2023-08-29 02:01:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:17,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:01:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:17,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:01:17,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:01:17,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 02:01:17,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:17,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:17,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 02:01:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:17,593 INFO L130 PetriNetUnfolder]: 291/670 cut-off events. [2023-08-29 02:01:17,594 INFO L131 PetriNetUnfolder]: For 549/557 co-relation queries the response was YES. [2023-08-29 02:01:17,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 670 events. 291/670 cut-off events. For 549/557 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3120 event pairs, 104 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 1992. Up to 545 conditions per place. [2023-08-29 02:01:17,599 INFO L137 encePairwiseOnDemand]: 152/166 looper letters, 89 selfloop transitions, 49 changer transitions 8/151 dead transitions. [2023-08-29 02:01:17,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 151 transitions, 1078 flow [2023-08-29 02:01:17,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:01:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:01:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-08-29 02:01:17,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2023-08-29 02:01:17,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-08-29 02:01:17,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-08-29 02:01:17,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:17,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-08-29 02:01:17,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:17,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:17,626 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:17,626 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 508 transitions. [2023-08-29 02:01:17,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 151 transitions, 1078 flow [2023-08-29 02:01:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 151 transitions, 1030 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 02:01:17,632 INFO L231 Difference]: Finished difference. Result has 88 places, 131 transitions, 869 flow [2023-08-29 02:01:17,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=88, PETRI_TRANSITIONS=131} [2023-08-29 02:01:17,634 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2023-08-29 02:01:17,634 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 131 transitions, 869 flow [2023-08-29 02:01:17,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:17,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:17,635 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:17,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 02:01:17,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:17,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash -835319141, now seen corresponding path program 1 times [2023-08-29 02:01:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480822762] [2023-08-29 02:01:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:17,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480822762] [2023-08-29 02:01:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480822762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 02:01:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555709297] [2023-08-29 02:01:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 02:01:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 02:01:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 02:01:18,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 166 [2023-08-29 02:01:18,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 131 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:18,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:18,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 166 [2023-08-29 02:01:18,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:18,300 INFO L130 PetriNetUnfolder]: 350/802 cut-off events. [2023-08-29 02:01:18,300 INFO L131 PetriNetUnfolder]: For 1113/1132 co-relation queries the response was YES. [2023-08-29 02:01:18,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 802 events. 350/802 cut-off events. For 1113/1132 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3990 event pairs, 84 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 2805. Up to 626 conditions per place. [2023-08-29 02:01:18,307 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 124 selfloop transitions, 58 changer transitions 16/203 dead transitions. [2023-08-29 02:01:18,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 203 transitions, 1636 flow [2023-08-29 02:01:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 02:01:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 02:01:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2023-08-29 02:01:18,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230923694779116 [2023-08-29 02:01:18,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 521 transitions. [2023-08-29 02:01:18,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 521 transitions. [2023-08-29 02:01:18,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:18,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 521 transitions. [2023-08-29 02:01:18,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:18,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:18,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 166.0) internal successors, (1162), 7 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:18,313 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 869 flow. Second operand 6 states and 521 transitions. [2023-08-29 02:01:18,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 203 transitions, 1636 flow [2023-08-29 02:01:18,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 203 transitions, 1572 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:18,334 INFO L231 Difference]: Finished difference. Result has 98 places, 175 transitions, 1341 flow [2023-08-29 02:01:18,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1341, PETRI_PLACES=98, PETRI_TRANSITIONS=175} [2023-08-29 02:01:18,335 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2023-08-29 02:01:18,335 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 175 transitions, 1341 flow [2023-08-29 02:01:18,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:18,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:18,336 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 02:01:18,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:18,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1071622368, now seen corresponding path program 1 times [2023-08-29 02:01:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121047097] [2023-08-29 02:01:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121047097] [2023-08-29 02:01:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121047097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:19,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 02:01:19,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241027555] [2023-08-29 02:01:19,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:19,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 02:01:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 02:01:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-08-29 02:01:20,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 02:01:20,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 175 transitions, 1341 flow. Second operand has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:20,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:20,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 02:01:20,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:21,103 INFO L130 PetriNetUnfolder]: 603/1428 cut-off events. [2023-08-29 02:01:21,103 INFO L131 PetriNetUnfolder]: For 3094/3137 co-relation queries the response was YES. [2023-08-29 02:01:21,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 1428 events. 603/1428 cut-off events. For 3094/3137 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9094 event pairs, 41 based on Foata normal form. 8/1433 useless extension candidates. Maximal degree in co-relation 5918. Up to 453 conditions per place. [2023-08-29 02:01:21,115 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 286 selfloop transitions, 81 changer transitions 41/436 dead transitions. [2023-08-29 02:01:21,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 436 transitions, 4051 flow [2023-08-29 02:01:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 02:01:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 02:01:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2023-08-29 02:01:21,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47200566973777464 [2023-08-29 02:01:21,119 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1332 transitions. [2023-08-29 02:01:21,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1332 transitions. [2023-08-29 02:01:21,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:21,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1332 transitions. [2023-08-29 02:01:21,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 78.3529411764706) internal successors, (1332), 17 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:21,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:21,127 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:21,127 INFO L175 Difference]: Start difference. First operand has 98 places, 175 transitions, 1341 flow. Second operand 17 states and 1332 transitions. [2023-08-29 02:01:21,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 436 transitions, 4051 flow [2023-08-29 02:01:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 436 transitions, 3909 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:21,156 INFO L231 Difference]: Finished difference. Result has 127 places, 242 transitions, 2187 flow [2023-08-29 02:01:21,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2187, PETRI_PLACES=127, PETRI_TRANSITIONS=242} [2023-08-29 02:01:21,157 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2023-08-29 02:01:21,157 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 242 transitions, 2187 flow [2023-08-29 02:01:21,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.4) internal successors, (714), 10 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:21,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:21,158 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:21,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 02:01:21,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:21,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1227228932, now seen corresponding path program 2 times [2023-08-29 02:01:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414131677] [2023-08-29 02:01:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414131677] [2023-08-29 02:01:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414131677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:01:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947354291] [2023-08-29 02:01:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:21,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:01:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:01:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:01:22,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-29 02:01:22,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 242 transitions, 2187 flow. Second operand has 9 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:22,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:22,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-29 02:01:22,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:22,573 INFO L130 PetriNetUnfolder]: 608/1488 cut-off events. [2023-08-29 02:01:22,573 INFO L131 PetriNetUnfolder]: For 5062/5115 co-relation queries the response was YES. [2023-08-29 02:01:22,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 1488 events. 608/1488 cut-off events. For 5062/5115 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9701 event pairs, 34 based on Foata normal form. 13/1498 useless extension candidates. Maximal degree in co-relation 6855. Up to 499 conditions per place. [2023-08-29 02:01:22,590 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 269 selfloop transitions, 83 changer transitions 29/409 dead transitions. [2023-08-29 02:01:22,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 409 transitions, 4201 flow [2023-08-29 02:01:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:01:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:01:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2023-08-29 02:01:22,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.499330655957162 [2023-08-29 02:01:22,593 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2023-08-29 02:01:22,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2023-08-29 02:01:22,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:22,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2023-08-29 02:01:22,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.88888888888889) internal successors, (746), 9 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:22,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:22,597 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:22,598 INFO L175 Difference]: Start difference. First operand has 127 places, 242 transitions, 2187 flow. Second operand 9 states and 746 transitions. [2023-08-29 02:01:22,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 409 transitions, 4201 flow [2023-08-29 02:01:22,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 409 transitions, 4187 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:22,656 INFO L231 Difference]: Finished difference. Result has 141 places, 276 transitions, 2871 flow [2023-08-29 02:01:22,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2871, PETRI_PLACES=141, PETRI_TRANSITIONS=276} [2023-08-29 02:01:22,657 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 102 predicate places. [2023-08-29 02:01:22,657 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 276 transitions, 2871 flow [2023-08-29 02:01:22,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:22,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:22,658 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 02:01:22,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:22,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash -535616722, now seen corresponding path program 1 times [2023-08-29 02:01:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301625558] [2023-08-29 02:01:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:01:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301625558] [2023-08-29 02:01:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301625558] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:01:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945303702] [2023-08-29 02:01:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:29,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:01:29,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:01:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 02:01:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:29,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 02:01:29,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:01:29,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 02:01:29,354 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 02:01:29,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-29 02:01:29,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 02:01:29,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 02:01:29,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 02:01:29,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 02:01:29,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:01:29,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:01:29,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:01:29,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 02:01:29,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-08-29 02:01:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-29 02:01:32,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:01:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945303702] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 02:01:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 02:01:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18, 13] total 38 [2023-08-29 02:01:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335199446] [2023-08-29 02:01:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:38,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:01:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:01:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1308, Unknown=2, NotChecked=0, Total=1482 [2023-08-29 02:01:41,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:01:41,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 276 transitions, 2871 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:41,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:41,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:01:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:50,039 INFO L130 PetriNetUnfolder]: 593/1472 cut-off events. [2023-08-29 02:01:50,039 INFO L131 PetriNetUnfolder]: For 7095/7151 co-relation queries the response was YES. [2023-08-29 02:01:50,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1472 events. 593/1472 cut-off events. For 7095/7151 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9596 event pairs, 51 based on Foata normal form. 16/1485 useless extension candidates. Maximal degree in co-relation 7382. Up to 476 conditions per place. [2023-08-29 02:01:50,059 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 281 selfloop transitions, 83 changer transitions 42/469 dead transitions. [2023-08-29 02:01:50,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 469 transitions, 5146 flow [2023-08-29 02:01:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 02:01:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 02:01:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1198 transitions. [2023-08-29 02:01:50,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811244979919679 [2023-08-29 02:01:50,064 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1198 transitions. [2023-08-29 02:01:50,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1198 transitions. [2023-08-29 02:01:50,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:50,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1198 transitions. [2023-08-29 02:01:50,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.86666666666666) internal successors, (1198), 15 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:50,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:50,071 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:50,071 INFO L175 Difference]: Start difference. First operand has 141 places, 276 transitions, 2871 flow. Second operand 15 states and 1198 transitions. [2023-08-29 02:01:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 469 transitions, 5146 flow [2023-08-29 02:01:50,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 469 transitions, 5082 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-29 02:01:50,126 INFO L231 Difference]: Finished difference. Result has 165 places, 332 transitions, 3674 flow [2023-08-29 02:01:50,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3674, PETRI_PLACES=165, PETRI_TRANSITIONS=332} [2023-08-29 02:01:50,127 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 126 predicate places. [2023-08-29 02:01:50,127 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 332 transitions, 3674 flow [2023-08-29 02:01:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:50,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:50,128 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:50,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-29 02:01:50,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:01:50,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:50,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 448036598, now seen corresponding path program 3 times [2023-08-29 02:01:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35435672] [2023-08-29 02:01:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35435672] [2023-08-29 02:01:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35435672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:01:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623837516] [2023-08-29 02:01:51,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:51,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:01:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:01:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:01:51,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:01:51,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 332 transitions, 3674 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:51,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:51,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:01:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:52,378 INFO L130 PetriNetUnfolder]: 587/1453 cut-off events. [2023-08-29 02:01:52,379 INFO L131 PetriNetUnfolder]: For 8427/8485 co-relation queries the response was YES. [2023-08-29 02:01:52,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1453 events. 587/1453 cut-off events. For 8427/8485 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9530 event pairs, 34 based on Foata normal form. 17/1466 useless extension candidates. Maximal degree in co-relation 7797. Up to 486 conditions per place. [2023-08-29 02:01:52,395 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 293 selfloop transitions, 86 changer transitions 36/456 dead transitions. [2023-08-29 02:01:52,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 456 transitions, 5489 flow [2023-08-29 02:01:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 02:01:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 02:01:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1193 transitions. [2023-08-29 02:01:52,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791164658634538 [2023-08-29 02:01:52,404 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1193 transitions. [2023-08-29 02:01:52,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1193 transitions. [2023-08-29 02:01:52,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:52,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1193 transitions. [2023-08-29 02:01:52,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.53333333333333) internal successors, (1193), 15 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:52,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:52,411 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:52,411 INFO L175 Difference]: Start difference. First operand has 165 places, 332 transitions, 3674 flow. Second operand 15 states and 1193 transitions. [2023-08-29 02:01:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 456 transitions, 5489 flow [2023-08-29 02:01:52,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 456 transitions, 5463 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-29 02:01:52,480 INFO L231 Difference]: Finished difference. Result has 176 places, 342 transitions, 4074 flow [2023-08-29 02:01:52,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=3656, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4074, PETRI_PLACES=176, PETRI_TRANSITIONS=342} [2023-08-29 02:01:52,481 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 137 predicate places. [2023-08-29 02:01:52,481 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 342 transitions, 4074 flow [2023-08-29 02:01:52,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:52,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:52,481 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:52,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 02:01:52,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:52,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash -308912082, now seen corresponding path program 2 times [2023-08-29 02:01:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:52,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147912381] [2023-08-29 02:01:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147912381] [2023-08-29 02:01:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147912381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:53,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 02:01:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465892923] [2023-08-29 02:01:53,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:53,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 02:01:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:53,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 02:01:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-29 02:01:54,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 166 [2023-08-29 02:01:54,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 342 transitions, 4074 flow. Second operand has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:54,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:54,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 166 [2023-08-29 02:01:54,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:55,124 INFO L130 PetriNetUnfolder]: 624/1531 cut-off events. [2023-08-29 02:01:55,124 INFO L131 PetriNetUnfolder]: For 11050/11128 co-relation queries the response was YES. [2023-08-29 02:01:55,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 1531 events. 624/1531 cut-off events. For 11050/11128 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10125 event pairs, 65 based on Foata normal form. 22/1549 useless extension candidates. Maximal degree in co-relation 8711. Up to 906 conditions per place. [2023-08-29 02:01:55,145 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 261 selfloop transitions, 114 changer transitions 36/459 dead transitions. [2023-08-29 02:01:55,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 459 transitions, 6144 flow [2023-08-29 02:01:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 02:01:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 02:01:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 803 transitions. [2023-08-29 02:01:55,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48373493975903614 [2023-08-29 02:01:55,149 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 803 transitions. [2023-08-29 02:01:55,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 803 transitions. [2023-08-29 02:01:55,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:55,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 803 transitions. [2023-08-29 02:01:55,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.3) internal successors, (803), 10 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) [2023-08-29 02:01:55,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:55,154 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:55,154 INFO L175 Difference]: Start difference. First operand has 176 places, 342 transitions, 4074 flow. Second operand 10 states and 803 transitions. [2023-08-29 02:01:55,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 459 transitions, 6144 flow [2023-08-29 02:01:55,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 459 transitions, 5984 flow, removed 41 selfloop flow, removed 4 redundant places. [2023-08-29 02:01:55,227 INFO L231 Difference]: Finished difference. Result has 185 places, 366 transitions, 4796 flow [2023-08-29 02:01:55,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=3944, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4796, PETRI_PLACES=185, PETRI_TRANSITIONS=366} [2023-08-29 02:01:55,229 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 146 predicate places. [2023-08-29 02:01:55,229 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 366 transitions, 4796 flow [2023-08-29 02:01:55,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.6) internal successors, (706), 10 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:55,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:55,230 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:55,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 02:01:55,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:55,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1222085252, now seen corresponding path program 3 times [2023-08-29 02:01:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851640507] [2023-08-29 02:01:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851640507] [2023-08-29 02:01:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851640507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:01:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425692457] [2023-08-29 02:01:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:55,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:01:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:01:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:01:56,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:01:56,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 366 transitions, 4796 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:56,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:56,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:01:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:01:57,344 INFO L130 PetriNetUnfolder]: 613/1529 cut-off events. [2023-08-29 02:01:57,344 INFO L131 PetriNetUnfolder]: For 14024/14094 co-relation queries the response was YES. [2023-08-29 02:01:57,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9400 conditions, 1529 events. 613/1529 cut-off events. For 14024/14094 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10224 event pairs, 57 based on Foata normal form. 17/1536 useless extension candidates. Maximal degree in co-relation 9296. Up to 516 conditions per place. [2023-08-29 02:01:57,360 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 312 selfloop transitions, 104 changer transitions 25/506 dead transitions. [2023-08-29 02:01:57,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 506 transitions, 6965 flow [2023-08-29 02:01:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 02:01:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 02:01:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 825 transitions. [2023-08-29 02:01:57,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49698795180722893 [2023-08-29 02:01:57,362 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 825 transitions. [2023-08-29 02:01:57,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 825 transitions. [2023-08-29 02:01:57,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:01:57,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 825 transitions. [2023-08-29 02:01:57,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.5) internal successors, (825), 10 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:57,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:57,367 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:57,367 INFO L175 Difference]: Start difference. First operand has 185 places, 366 transitions, 4796 flow. Second operand 10 states and 825 transitions. [2023-08-29 02:01:57,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 506 transitions, 6965 flow [2023-08-29 02:01:57,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 506 transitions, 6905 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-29 02:01:57,445 INFO L231 Difference]: Finished difference. Result has 195 places, 390 transitions, 5454 flow [2023-08-29 02:01:57,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=4742, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5454, PETRI_PLACES=195, PETRI_TRANSITIONS=390} [2023-08-29 02:01:57,446 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 156 predicate places. [2023-08-29 02:01:57,446 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 390 transitions, 5454 flow [2023-08-29 02:01:57,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:57,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:01:57,446 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:01:57,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 02:01:57,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:01:57,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:01:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2052644462, now seen corresponding path program 4 times [2023-08-29 02:01:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:01:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007804496] [2023-08-29 02:01:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:01:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:01:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:01:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:01:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:01:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007804496] [2023-08-29 02:01:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007804496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:01:59,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:01:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 02:01:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485776750] [2023-08-29 02:01:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:01:59,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 02:01:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:01:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 02:01:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-29 02:01:59,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-08-29 02:01:59,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 390 transitions, 5454 flow. Second operand has 11 states, 11 states have (on average 69.45454545454545) internal successors, (764), 11 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:01:59,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:01:59,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-08-29 02:01:59,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:00,865 INFO L130 PetriNetUnfolder]: 692/1704 cut-off events. [2023-08-29 02:02:00,866 INFO L131 PetriNetUnfolder]: For 18631/18717 co-relation queries the response was YES. [2023-08-29 02:02:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11146 conditions, 1704 events. 692/1704 cut-off events. For 18631/18717 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11614 event pairs, 60 based on Foata normal form. 22/1722 useless extension candidates. Maximal degree in co-relation 11036. Up to 951 conditions per place. [2023-08-29 02:02:00,886 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 287 selfloop transitions, 165 changer transitions 21/521 dead transitions. [2023-08-29 02:02:00,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 521 transitions, 8031 flow [2023-08-29 02:02:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 02:02:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 02:02:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2023-08-29 02:02:00,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2023-08-29 02:02:00,889 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 936 transitions. [2023-08-29 02:02:00,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 936 transitions. [2023-08-29 02:02:00,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:00,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 936 transitions. [2023-08-29 02:02:00,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 78.0) internal successors, (936), 12 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:00,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:00,895 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 166.0) internal successors, (2158), 13 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:00,895 INFO L175 Difference]: Start difference. First operand has 195 places, 390 transitions, 5454 flow. Second operand 12 states and 936 transitions. [2023-08-29 02:02:00,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 521 transitions, 8031 flow [2023-08-29 02:02:00,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 521 transitions, 7959 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-08-29 02:02:00,980 INFO L231 Difference]: Finished difference. Result has 214 places, 436 transitions, 6857 flow [2023-08-29 02:02:00,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=5384, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6857, PETRI_PLACES=214, PETRI_TRANSITIONS=436} [2023-08-29 02:02:00,981 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2023-08-29 02:02:00,981 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 436 transitions, 6857 flow [2023-08-29 02:02:00,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.45454545454545) internal successors, (764), 11 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:00,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:00,982 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:00,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 02:02:00,982 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:00,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2135421222, now seen corresponding path program 1 times [2023-08-29 02:02:00,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784389019] [2023-08-29 02:02:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784389019] [2023-08-29 02:02:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784389019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:02:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664204613] [2023-08-29 02:02:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:01,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:02:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:02:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:02:01,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:02:01,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 436 transitions, 6857 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:01,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:01,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:02:01,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:02,727 INFO L130 PetriNetUnfolder]: 808/1923 cut-off events. [2023-08-29 02:02:02,727 INFO L131 PetriNetUnfolder]: For 26893/26933 co-relation queries the response was YES. [2023-08-29 02:02:02,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13594 conditions, 1923 events. 808/1923 cut-off events. For 26893/26933 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12758 event pairs, 163 based on Foata normal form. 1/1875 useless extension candidates. Maximal degree in co-relation 13468. Up to 1321 conditions per place. [2023-08-29 02:02:02,748 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 312 selfloop transitions, 168 changer transitions 29/514 dead transitions. [2023-08-29 02:02:02,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 514 transitions, 8742 flow [2023-08-29 02:02:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 02:02:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 02:02:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 617 transitions. [2023-08-29 02:02:02,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46460843373493976 [2023-08-29 02:02:02,750 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 617 transitions. [2023-08-29 02:02:02,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 617 transitions. [2023-08-29 02:02:02,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:02,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 617 transitions. [2023-08-29 02:02:02,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.125) internal successors, (617), 8 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:02,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:02,754 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:02,754 INFO L175 Difference]: Start difference. First operand has 214 places, 436 transitions, 6857 flow. Second operand 8 states and 617 transitions. [2023-08-29 02:02:02,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 514 transitions, 8742 flow [2023-08-29 02:02:02,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 514 transitions, 8641 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-29 02:02:02,868 INFO L231 Difference]: Finished difference. Result has 222 places, 453 transitions, 7397 flow [2023-08-29 02:02:02,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=6764, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7397, PETRI_PLACES=222, PETRI_TRANSITIONS=453} [2023-08-29 02:02:02,869 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 183 predicate places. [2023-08-29 02:02:02,869 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 453 transitions, 7397 flow [2023-08-29 02:02:02,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:02,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:02,870 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 02:02:02,870 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:02,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash 275868054, now seen corresponding path program 5 times [2023-08-29 02:02:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715273323] [2023-08-29 02:02:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715273323] [2023-08-29 02:02:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715273323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:02:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950151942] [2023-08-29 02:02:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:04,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:02:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:02:04,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:02:04,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:02:04,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 453 transitions, 7397 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:04,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:04,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:02:04,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:05,501 INFO L130 PetriNetUnfolder]: 749/1848 cut-off events. [2023-08-29 02:02:05,501 INFO L131 PetriNetUnfolder]: For 30104/30209 co-relation queries the response was YES. [2023-08-29 02:02:05,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13546 conditions, 1848 events. 749/1848 cut-off events. For 30104/30209 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12974 event pairs, 69 based on Foata normal form. 32/1866 useless extension candidates. Maximal degree in co-relation 13421. Up to 915 conditions per place. [2023-08-29 02:02:05,522 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 325 selfloop transitions, 177 changer transitions 23/599 dead transitions. [2023-08-29 02:02:05,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 599 transitions, 10531 flow [2023-08-29 02:02:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:02:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:02:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2023-08-29 02:02:05,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49866131191432395 [2023-08-29 02:02:05,525 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2023-08-29 02:02:05,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2023-08-29 02:02:05,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:05,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2023-08-29 02:02:05,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:05,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:05,528 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:05,529 INFO L175 Difference]: Start difference. First operand has 222 places, 453 transitions, 7397 flow. Second operand 9 states and 745 transitions. [2023-08-29 02:02:05,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 599 transitions, 10531 flow [2023-08-29 02:02:05,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 599 transitions, 10390 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 02:02:05,705 INFO L231 Difference]: Finished difference. Result has 235 places, 502 transitions, 9025 flow [2023-08-29 02:02:05,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=7281, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9025, PETRI_PLACES=235, PETRI_TRANSITIONS=502} [2023-08-29 02:02:05,707 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2023-08-29 02:02:05,707 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 502 transitions, 9025 flow [2023-08-29 02:02:05,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:05,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:05,708 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:05,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 02:02:05,708 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:05,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 339846000, now seen corresponding path program 2 times [2023-08-29 02:02:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:05,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188266787] [2023-08-29 02:02:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188266787] [2023-08-29 02:02:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188266787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:02:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964671961] [2023-08-29 02:02:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:02:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:02:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:02:06,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:02:06,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 502 transitions, 9025 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:06,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:06,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:02:06,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:07,510 INFO L130 PetriNetUnfolder]: 893/2125 cut-off events. [2023-08-29 02:02:07,510 INFO L131 PetriNetUnfolder]: For 41007/41060 co-relation queries the response was YES. [2023-08-29 02:02:07,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16453 conditions, 2125 events. 893/2125 cut-off events. For 41007/41060 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14608 event pairs, 175 based on Foata normal form. 6/2130 useless extension candidates. Maximal degree in co-relation 16316. Up to 1481 conditions per place. [2023-08-29 02:02:07,534 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 362 selfloop transitions, 183 changer transitions 13/563 dead transitions. [2023-08-29 02:02:07,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 563 transitions, 10851 flow [2023-08-29 02:02:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 02:02:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 02:02:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 604 transitions. [2023-08-29 02:02:07,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45481927710843373 [2023-08-29 02:02:07,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 604 transitions. [2023-08-29 02:02:07,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 604 transitions. [2023-08-29 02:02:07,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:07,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 604 transitions. [2023-08-29 02:02:07,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 75.5) internal successors, (604), 8 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:07,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:07,541 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:07,541 INFO L175 Difference]: Start difference. First operand has 235 places, 502 transitions, 9025 flow. Second operand 8 states and 604 transitions. [2023-08-29 02:02:07,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 563 transitions, 10851 flow [2023-08-29 02:02:07,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 563 transitions, 10769 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-29 02:02:07,775 INFO L231 Difference]: Finished difference. Result has 245 places, 523 transitions, 9809 flow [2023-08-29 02:02:07,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=8943, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9809, PETRI_PLACES=245, PETRI_TRANSITIONS=523} [2023-08-29 02:02:07,776 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 206 predicate places. [2023-08-29 02:02:07,776 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 523 transitions, 9809 flow [2023-08-29 02:02:07,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:07,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:07,777 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:07,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 02:02:07,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:07,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1652558750, now seen corresponding path program 3 times [2023-08-29 02:02:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918072986] [2023-08-29 02:02:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918072986] [2023-08-29 02:02:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918072986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:02:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606176598] [2023-08-29 02:02:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:08,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:02:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:02:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:02:08,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:02:08,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 523 transitions, 9809 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:08,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:08,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:02:08,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:09,584 INFO L130 PetriNetUnfolder]: 907/2157 cut-off events. [2023-08-29 02:02:09,584 INFO L131 PetriNetUnfolder]: For 46752/46811 co-relation queries the response was YES. [2023-08-29 02:02:09,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 2157 events. 907/2157 cut-off events. For 46752/46811 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14828 event pairs, 168 based on Foata normal form. 5/2161 useless extension candidates. Maximal degree in co-relation 17125. Up to 945 conditions per place. [2023-08-29 02:02:09,606 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 397 selfloop transitions, 244 changer transitions 22/668 dead transitions. [2023-08-29 02:02:09,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 668 transitions, 12670 flow [2023-08-29 02:02:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 02:02:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 02:02:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1034 transitions. [2023-08-29 02:02:09,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47914735866543096 [2023-08-29 02:02:09,609 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1034 transitions. [2023-08-29 02:02:09,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1034 transitions. [2023-08-29 02:02:09,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:09,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1034 transitions. [2023-08-29 02:02:09,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 79.53846153846153) internal successors, (1034), 13 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:09,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:09,614 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:09,614 INFO L175 Difference]: Start difference. First operand has 245 places, 523 transitions, 9809 flow. Second operand 13 states and 1034 transitions. [2023-08-29 02:02:09,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 668 transitions, 12670 flow [2023-08-29 02:02:09,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 668 transitions, 12620 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-29 02:02:09,892 INFO L231 Difference]: Finished difference. Result has 260 places, 563 transitions, 11041 flow [2023-08-29 02:02:09,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=9763, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11041, PETRI_PLACES=260, PETRI_TRANSITIONS=563} [2023-08-29 02:02:09,893 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 221 predicate places. [2023-08-29 02:02:09,893 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 563 transitions, 11041 flow [2023-08-29 02:02:09,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:09,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:09,894 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:09,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 02:02:09,894 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:09,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 382165376, now seen corresponding path program 4 times [2023-08-29 02:02:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393309786] [2023-08-29 02:02:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393309786] [2023-08-29 02:02:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393309786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:10,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-08-29 02:02:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5308231] [2023-08-29 02:02:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:10,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 02:02:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 02:02:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-08-29 02:02:11,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 166 [2023-08-29 02:02:11,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 563 transitions, 11041 flow. Second operand has 14 states, 14 states have (on average 58.357142857142854) internal successors, (817), 14 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:11,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:11,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 166 [2023-08-29 02:02:11,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:13,073 INFO L130 PetriNetUnfolder]: 1413/3198 cut-off events. [2023-08-29 02:02:13,073 INFO L131 PetriNetUnfolder]: For 71060/71132 co-relation queries the response was YES. [2023-08-29 02:02:13,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26743 conditions, 3198 events. 1413/3198 cut-off events. For 71060/71132 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23259 event pairs, 173 based on Foata normal form. 5/3202 useless extension candidates. Maximal degree in co-relation 26598. Up to 1184 conditions per place. [2023-08-29 02:02:13,118 INFO L137 encePairwiseOnDemand]: 145/166 looper letters, 768 selfloop transitions, 253 changer transitions 25/1050 dead transitions. [2023-08-29 02:02:13,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1050 transitions, 21132 flow [2023-08-29 02:02:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 02:02:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 02:02:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1451 transitions. [2023-08-29 02:02:13,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41623637406769937 [2023-08-29 02:02:13,121 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1451 transitions. [2023-08-29 02:02:13,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1451 transitions. [2023-08-29 02:02:13,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:13,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1451 transitions. [2023-08-29 02:02:13,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 69.0952380952381) internal successors, (1451), 21 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:13,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 166.0) internal successors, (3652), 22 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:13,129 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 166.0) internal successors, (3652), 22 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:13,129 INFO L175 Difference]: Start difference. First operand has 260 places, 563 transitions, 11041 flow. Second operand 21 states and 1451 transitions. [2023-08-29 02:02:13,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1050 transitions, 21132 flow [2023-08-29 02:02:13,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1050 transitions, 20728 flow, removed 198 selfloop flow, removed 1 redundant places. [2023-08-29 02:02:13,622 INFO L231 Difference]: Finished difference. Result has 292 places, 741 transitions, 15065 flow [2023-08-29 02:02:13,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=10895, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=15065, PETRI_PLACES=292, PETRI_TRANSITIONS=741} [2023-08-29 02:02:13,623 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2023-08-29 02:02:13,623 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 741 transitions, 15065 flow [2023-08-29 02:02:13,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 58.357142857142854) internal successors, (817), 14 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:13,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:13,623 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:13,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 02:02:13,624 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:13,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1639249436, now seen corresponding path program 6 times [2023-08-29 02:02:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731033684] [2023-08-29 02:02:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:02:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:02:14,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:02:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731033684] [2023-08-29 02:02:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731033684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:02:14,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:02:14,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:02:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150957438] [2023-08-29 02:02:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:02:14,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:02:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:02:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:02:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:02:15,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:02:15,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 741 transitions, 15065 flow. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:15,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:02:15,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:02:15,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:02:16,805 INFO L130 PetriNetUnfolder]: 1119/2750 cut-off events. [2023-08-29 02:02:16,805 INFO L131 PetriNetUnfolder]: For 78997/79280 co-relation queries the response was YES. [2023-08-29 02:02:16,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25029 conditions, 2750 events. 1119/2750 cut-off events. For 78997/79280 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21271 event pairs, 51 based on Foata normal form. 36/2774 useless extension candidates. Maximal degree in co-relation 24870. Up to 1606 conditions per place. [2023-08-29 02:02:16,839 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 480 selfloop transitions, 225 changer transitions 21/867 dead transitions. [2023-08-29 02:02:16,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 867 transitions, 18594 flow [2023-08-29 02:02:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:02:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:02:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-29 02:02:16,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-29 02:02:16,842 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-29 02:02:16,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-29 02:02:16,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:02:16,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-29 02:02:16,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:16,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:16,846 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:16,846 INFO L175 Difference]: Start difference. First operand has 292 places, 741 transitions, 15065 flow. Second operand 9 states and 743 transitions. [2023-08-29 02:02:16,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 867 transitions, 18594 flow [2023-08-29 02:02:17,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 867 transitions, 18504 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-08-29 02:02:17,306 INFO L231 Difference]: Finished difference. Result has 306 places, 779 transitions, 16974 flow [2023-08-29 02:02:17,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=14977, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16974, PETRI_PLACES=306, PETRI_TRANSITIONS=779} [2023-08-29 02:02:17,307 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 267 predicate places. [2023-08-29 02:02:17,307 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 779 transitions, 16974 flow [2023-08-29 02:02:17,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 9 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:02:17,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:02:17,307 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:02:17,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 02:02:17,308 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:02:17,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:02:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1834866135, now seen corresponding path program 1 times [2023-08-29 02:02:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:02:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988622460] [2023-08-29 02:02:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:02:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:02:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:04:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988622460] [2023-08-29 02:04:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988622460] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140291927] [2023-08-29 02:04:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:04,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:04:04,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:04:04,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:04:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 02:04:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:04,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-29 02:04:04,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:04:04,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-29 02:04:04,318 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 02:04:04,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-29 02:04:04,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 02:04:04,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 02:04:04,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 02:04:04,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 02:04:04,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:04,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 02:04:04,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2023-08-29 02:04:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-29 02:04:04,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:04:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140291927] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 02:04:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 11] total 35 [2023-08-29 02:04:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234086523] [2023-08-29 02:04:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:05,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:05,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2023-08-29 02:04:08,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:04:08,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 779 transitions, 16974 flow. Second operand has 9 states, 9 states have (on average 67.11111111111111) internal successors, (604), 9 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:08,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:08,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:04:08,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:12,988 INFO L130 PetriNetUnfolder]: 1261/3030 cut-off events. [2023-08-29 02:04:12,988 INFO L131 PetriNetUnfolder]: For 93037/93215 co-relation queries the response was YES. [2023-08-29 02:04:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28731 conditions, 3030 events. 1261/3030 cut-off events. For 93037/93215 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22964 event pairs, 185 based on Foata normal form. 11/3041 useless extension candidates. Maximal degree in co-relation 28565. Up to 1495 conditions per place. [2023-08-29 02:04:13,030 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 687 selfloop transitions, 196 changer transitions 44/937 dead transitions. [2023-08-29 02:04:13,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 937 transitions, 21274 flow [2023-08-29 02:04:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 02:04:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 02:04:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1131 transitions. [2023-08-29 02:04:13,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542168674698795 [2023-08-29 02:04:13,033 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1131 transitions. [2023-08-29 02:04:13,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1131 transitions. [2023-08-29 02:04:13,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:13,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1131 transitions. [2023-08-29 02:04:13,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 75.4) internal successors, (1131), 15 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:13,037 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:13,038 INFO L175 Difference]: Start difference. First operand has 306 places, 779 transitions, 16974 flow. Second operand 15 states and 1131 transitions. [2023-08-29 02:04:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 937 transitions, 21274 flow [2023-08-29 02:04:13,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 937 transitions, 21157 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-29 02:04:13,488 INFO L231 Difference]: Finished difference. Result has 326 places, 838 transitions, 18400 flow [2023-08-29 02:04:13,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=16868, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=18400, PETRI_PLACES=326, PETRI_TRANSITIONS=838} [2023-08-29 02:04:13,489 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 287 predicate places. [2023-08-29 02:04:13,489 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 838 transitions, 18400 flow [2023-08-29 02:04:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.11111111111111) internal successors, (604), 9 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:13,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:13,490 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:13,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 02:04:13,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:04:13,691 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:13,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash 643269942, now seen corresponding path program 5 times [2023-08-29 02:04:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825419830] [2023-08-29 02:04:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:04:16,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825419830] [2023-08-29 02:04:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825419830] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:16,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934925367] [2023-08-29 02:04:16,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 02:04:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:04:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:04:16,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:04:16,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 02:04:16,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 02:04:16,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 02:04:16,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-29 02:04:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:04:16,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-29 02:04:16,866 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 02:04:16,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-29 02:04:16,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-29 02:04:17,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-29 02:04:17,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 02:04:17,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-29 02:04:17,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:17,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:17,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 02:04:17,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2023-08-29 02:04:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 02:04:23,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:04:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934925367] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 02:04:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 16] total 41 [2023-08-29 02:04:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679439571] [2023-08-29 02:04:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1537, Unknown=3, NotChecked=0, Total=1722 [2023-08-29 02:04:28,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:04:28,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 838 transitions, 18400 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:28,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:28,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:04:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:34,419 INFO L130 PetriNetUnfolder]: 1284/3055 cut-off events. [2023-08-29 02:04:34,419 INFO L131 PetriNetUnfolder]: For 96219/96287 co-relation queries the response was YES. [2023-08-29 02:04:34,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30034 conditions, 3055 events. 1284/3055 cut-off events. For 96219/96287 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23020 event pairs, 207 based on Foata normal form. 13/3067 useless extension candidates. Maximal degree in co-relation 29861. Up to 1612 conditions per place. [2023-08-29 02:04:34,461 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 555 selfloop transitions, 335 changer transitions 14/914 dead transitions. [2023-08-29 02:04:34,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 914 transitions, 21360 flow [2023-08-29 02:04:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:04:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:04:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2023-08-29 02:04:34,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47925033467202144 [2023-08-29 02:04:34,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2023-08-29 02:04:34,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2023-08-29 02:04:34,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:34,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2023-08-29 02:04:34,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.55555555555556) internal successors, (716), 9 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:34,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:34,466 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:34,466 INFO L175 Difference]: Start difference. First operand has 326 places, 838 transitions, 18400 flow. Second operand 9 states and 716 transitions. [2023-08-29 02:04:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 914 transitions, 21360 flow [2023-08-29 02:04:34,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 914 transitions, 21150 flow, removed 101 selfloop flow, removed 3 redundant places. [2023-08-29 02:04:35,001 INFO L231 Difference]: Finished difference. Result has 329 places, 859 transitions, 19464 flow [2023-08-29 02:04:35,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=18194, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19464, PETRI_PLACES=329, PETRI_TRANSITIONS=859} [2023-08-29 02:04:35,003 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 290 predicate places. [2023-08-29 02:04:35,003 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 859 transitions, 19464 flow [2023-08-29 02:04:35,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:35,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:35,004 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:35,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-29 02:04:35,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-29 02:04:35,210 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:35,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1293712730, now seen corresponding path program 6 times [2023-08-29 02:04:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730489091] [2023-08-29 02:04:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730489091] [2023-08-29 02:04:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730489091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:04:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:04:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:04:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784954427] [2023-08-29 02:04:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:35,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:04:35,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:04:35,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 859 transitions, 19464 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:35,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:35,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:04:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:37,285 INFO L130 PetriNetUnfolder]: 1285/3058 cut-off events. [2023-08-29 02:04:37,285 INFO L131 PetriNetUnfolder]: For 101093/101157 co-relation queries the response was YES. [2023-08-29 02:04:37,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30877 conditions, 3058 events. 1285/3058 cut-off events. For 101093/101157 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23059 event pairs, 197 based on Foata normal form. 2/3059 useless extension candidates. Maximal degree in co-relation 30703. Up to 2183 conditions per place. [2023-08-29 02:04:37,331 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 535 selfloop transitions, 347 changer transitions 22/914 dead transitions. [2023-08-29 02:04:37,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 914 transitions, 21999 flow [2023-08-29 02:04:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 02:04:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 02:04:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 626 transitions. [2023-08-29 02:04:37,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713855421686747 [2023-08-29 02:04:37,333 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 626 transitions. [2023-08-29 02:04:37,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 626 transitions. [2023-08-29 02:04:37,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:37,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 626 transitions. [2023-08-29 02:04:37,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.25) internal successors, (626), 8 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:37,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:37,337 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 166.0) internal successors, (1494), 9 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:37,337 INFO L175 Difference]: Start difference. First operand has 329 places, 859 transitions, 19464 flow. Second operand 8 states and 626 transitions. [2023-08-29 02:04:37,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 914 transitions, 21999 flow [2023-08-29 02:04:37,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 914 transitions, 21595 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-29 02:04:37,928 INFO L231 Difference]: Finished difference. Result has 331 places, 861 transitions, 19872 flow [2023-08-29 02:04:37,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19072, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=19872, PETRI_PLACES=331, PETRI_TRANSITIONS=861} [2023-08-29 02:04:37,931 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 292 predicate places. [2023-08-29 02:04:37,931 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 861 transitions, 19872 flow [2023-08-29 02:04:37,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:37,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:37,931 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:37,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 02:04:37,933 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:37,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1414769900, now seen corresponding path program 7 times [2023-08-29 02:04:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565110029] [2023-08-29 02:04:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565110029] [2023-08-29 02:04:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565110029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:04:38,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:04:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:04:38,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180471167] [2023-08-29 02:04:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:38,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:38,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:38,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:04:38,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-29 02:04:38,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 861 transitions, 19872 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:38,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:38,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-29 02:04:38,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:40,397 INFO L130 PetriNetUnfolder]: 1282/3053 cut-off events. [2023-08-29 02:04:40,397 INFO L131 PetriNetUnfolder]: For 101660/101749 co-relation queries the response was YES. [2023-08-29 02:04:40,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31061 conditions, 3053 events. 1282/3053 cut-off events. For 101660/101749 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23034 event pairs, 197 based on Foata normal form. 3/3055 useless extension candidates. Maximal degree in co-relation 30889. Up to 2175 conditions per place. [2023-08-29 02:04:40,439 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 533 selfloop transitions, 353 changer transitions 21/917 dead transitions. [2023-08-29 02:04:40,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 917 transitions, 22443 flow [2023-08-29 02:04:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:04:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:04:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 694 transitions. [2023-08-29 02:04:40,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464524765729585 [2023-08-29 02:04:40,441 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 694 transitions. [2023-08-29 02:04:40,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 694 transitions. [2023-08-29 02:04:40,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:40,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 694 transitions. [2023-08-29 02:04:40,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.11111111111111) internal successors, (694), 9 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:40,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:40,443 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:40,443 INFO L175 Difference]: Start difference. First operand has 331 places, 861 transitions, 19872 flow. Second operand 9 states and 694 transitions. [2023-08-29 02:04:40,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 917 transitions, 22443 flow [2023-08-29 02:04:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 917 transitions, 21850 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-29 02:04:41,076 INFO L231 Difference]: Finished difference. Result has 338 places, 865 transitions, 20205 flow [2023-08-29 02:04:41,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19281, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=350, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20205, PETRI_PLACES=338, PETRI_TRANSITIONS=865} [2023-08-29 02:04:41,077 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 299 predicate places. [2023-08-29 02:04:41,077 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 865 transitions, 20205 flow [2023-08-29 02:04:41,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:41,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:41,078 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:41,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 02:04:41,078 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:41,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash -536452000, now seen corresponding path program 4 times [2023-08-29 02:04:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119389048] [2023-08-29 02:04:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119389048] [2023-08-29 02:04:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119389048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:04:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 02:04:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 02:04:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293139534] [2023-08-29 02:04:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:42,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-29 02:04:42,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-29 02:04:42,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 865 transitions, 20205 flow. Second operand has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:42,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:42,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-29 02:04:42,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:44,166 INFO L130 PetriNetUnfolder]: 1167/2851 cut-off events. [2023-08-29 02:04:44,166 INFO L131 PetriNetUnfolder]: For 102187/102384 co-relation queries the response was YES. [2023-08-29 02:04:44,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29831 conditions, 2851 events. 1167/2851 cut-off events. For 102187/102384 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22127 event pairs, 49 based on Foata normal form. 56/2905 useless extension candidates. Maximal degree in co-relation 29656. Up to 1213 conditions per place. [2023-08-29 02:04:44,208 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 658 selfloop transitions, 280 changer transitions 22/1061 dead transitions. [2023-08-29 02:04:44,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1061 transitions, 25885 flow [2023-08-29 02:04:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 02:04:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 02:04:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-29 02:04:44,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-29 02:04:44,210 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-29 02:04:44,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-29 02:04:44,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:44,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-29 02:04:44,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.55555555555556) internal successors, (743), 9 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:44,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:44,213 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:44,214 INFO L175 Difference]: Start difference. First operand has 338 places, 865 transitions, 20205 flow. Second operand 9 states and 743 transitions. [2023-08-29 02:04:44,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1061 transitions, 25885 flow [2023-08-29 02:04:44,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1061 transitions, 25837 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-29 02:04:44,735 INFO L231 Difference]: Finished difference. Result has 351 places, 893 transitions, 21889 flow [2023-08-29 02:04:44,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=20167, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21889, PETRI_PLACES=351, PETRI_TRANSITIONS=893} [2023-08-29 02:04:44,736 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 312 predicate places. [2023-08-29 02:04:44,736 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 893 transitions, 21889 flow [2023-08-29 02:04:44,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.55555555555556) internal successors, (653), 9 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:44,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:44,737 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 02:04:44,737 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:44,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash 222619341, now seen corresponding path program 2 times [2023-08-29 02:04:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:44,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449858540] [2023-08-29 02:04:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:04:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449858540] [2023-08-29 02:04:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449858540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874248647] [2023-08-29 02:04:47,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 02:04:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:04:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:04:47,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:04:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 02:04:48,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 02:04:48,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 02:04:48,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-29 02:04:48,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:04:48,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 02:04:48,108 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 02:04:48,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-29 02:04:48,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 02:04:48,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 02:04:48,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 02:04:48,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-29 02:04:48,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:48,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 02:04:48,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2023-08-29 02:04:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:04:48,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 02:04:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874248647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 02:04:48,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 02:04:48,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2023-08-29 02:04:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300353031] [2023-08-29 02:04:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:04:48,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 02:04:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:04:48,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 02:04:48,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2023-08-29 02:04:48,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 166 [2023-08-29 02:04:48,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 893 transitions, 21889 flow. Second operand has 9 states, 9 states have (on average 66.11111111111111) internal successors, (595), 9 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:48,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:04:48,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 166 [2023-08-29 02:04:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:04:50,803 INFO L130 PetriNetUnfolder]: 1358/3227 cut-off events. [2023-08-29 02:04:50,804 INFO L131 PetriNetUnfolder]: For 119392/119553 co-relation queries the response was YES. [2023-08-29 02:04:50,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34757 conditions, 3227 events. 1358/3227 cut-off events. For 119392/119553 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 24616 event pairs, 203 based on Foata normal form. 24/3251 useless extension candidates. Maximal degree in co-relation 34576. Up to 1797 conditions per place. [2023-08-29 02:04:50,854 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 896 selfloop transitions, 114 changer transitions 64/1084 dead transitions. [2023-08-29 02:04:50,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1084 transitions, 27744 flow [2023-08-29 02:04:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 02:04:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 02:04:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 788 transitions. [2023-08-29 02:04:50,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746987951807229 [2023-08-29 02:04:50,856 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 788 transitions. [2023-08-29 02:04:50,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 788 transitions. [2023-08-29 02:04:50,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 02:04:50,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 788 transitions. [2023-08-29 02:04:50,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.8) internal successors, (788), 10 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:50,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:50,858 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:50,859 INFO L175 Difference]: Start difference. First operand has 351 places, 893 transitions, 21889 flow. Second operand 10 states and 788 transitions. [2023-08-29 02:04:50,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1084 transitions, 27744 flow [2023-08-29 02:04:51,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1084 transitions, 27687 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 02:04:51,579 INFO L231 Difference]: Finished difference. Result has 363 places, 931 transitions, 23029 flow [2023-08-29 02:04:51,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=21836, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23029, PETRI_PLACES=363, PETRI_TRANSITIONS=931} [2023-08-29 02:04:51,580 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 324 predicate places. [2023-08-29 02:04:51,581 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 931 transitions, 23029 flow [2023-08-29 02:04:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.11111111111111) internal successors, (595), 9 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:04:51,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 02:04:51,581 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 02:04:51,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-29 02:04:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 02:04:51,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-29 02:04:51,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 02:04:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1476552406, now seen corresponding path program 5 times [2023-08-29 02:04:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 02:04:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506715416] [2023-08-29 02:04:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 02:04:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 02:04:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 02:04:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 02:04:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 02:04:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506715416] [2023-08-29 02:04:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506715416] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 02:04:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979299740] [2023-08-29 02:04:57,104 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 02:04:57,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 02:04:57,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 02:04:57,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 02:04:57,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 02:04:57,245 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 02:04:57,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 02:04:57,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-29 02:04:57,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 02:04:57,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 02:04:57,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 02:04:57,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-29 02:04:57,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 02:04:57,774 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-29 02:04:57,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2023-08-29 02:04:57,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:57,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-08-29 02:04:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:57,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-29 02:04:58,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2023-08-29 02:04:58,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-29 02:04:58,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 89 [2023-08-29 02:04:58,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 02:04:58,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 02:04:58,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 123 [2023-08-29 02:05:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 02:05:08,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 02:06:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 02:06:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979299740] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 02:06:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 02:06:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19, 19] total 48 [2023-08-29 02:06:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357119817] [2023-08-29 02:06:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 02:06:00,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 02:06:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 02:06:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 02:06:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2115, Unknown=10, NotChecked=0, Total=2352 [2023-08-29 02:06:02,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:04,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:06,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:08,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:10,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:12,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:14,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:16,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:18,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:20,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:22,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:24,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:26,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:28,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:30,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:32,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:35,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:37,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:39,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:41,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:43,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:45,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:47,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:49,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:53,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:55,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:57,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:06:59,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:01,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:03,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:05,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:07,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:09,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:11,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:13,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:15,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:15,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 166 [2023-08-29 02:07:15,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 931 transitions, 23029 flow. Second operand has 13 states, 13 states have (on average 56.53846153846154) internal successors, (735), 13 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 02:07:15,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 02:07:15,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 166 [2023-08-29 02:07:15,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 02:07:23,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:26,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:28,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:31,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:33,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:36,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:39,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:41,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:43,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:46,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:48,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:50,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:51,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:52,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:54,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:57,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:07:59,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:01,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:04,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:07,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:09,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:11,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:13,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:15,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:19,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:21,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:23,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:33,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:35,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:37,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:40,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:42,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:44,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:46,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:48,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:50,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:52,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:57,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:08:59,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:01,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:03,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:05,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:07,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:09,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:11,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:14,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:24,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:27,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:29,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:31,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:33,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:35,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:37,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:39,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:41,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:43,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:46,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:48,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:50,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:52,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:54,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:09:56,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:04,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:06,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:17,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:19,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:21,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:23,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:25,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:29,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:31,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:33,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:35,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:37,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:38,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:40,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:42,995 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse18 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse14 .cse18 0)))) (let ((.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse22 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse7 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse7 |c_~#a~0.offset| 1) 0) (+ .cse7 2 |c_~#a~0.offset|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse8 |c_~#a~0.base| (store (store (select .cse8 |c_~#a~0.base|) (+ .cse7 3 |c_~#a~0.offset|) 0) (+ .cse7 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse11 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse11 |c_~#a~0.offset| 1) 0) (+ .cse11 2 |c_~#a~0.offset|) 0)))) (store .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse12 |c_~#a~0.base| (store (store (select .cse12 |c_~#a~0.base|) (+ .cse11 3 |c_~#a~0.offset|) 0) (+ .cse11 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (= (select .cse14 .cse4) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse15 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse15 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse15 |c_~#a~0.offset| 1) 0) (+ .cse15 2 |c_~#a~0.offset|) 0)))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse16 |c_~#a~0.base| (store (store (select .cse16 |c_~#a~0.base|) (+ .cse15 3 |c_~#a~0.offset|) 0) (+ .cse15 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))) (= 0 (select .cse14 |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse19 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse19 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse20 (let ((.cse21 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse19 |c_~#a~0.offset| 1) 0) (+ .cse19 2 |c_~#a~0.offset|) 0)))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse20 |c_~#a~0.base| (store (store (select .cse20 |c_~#a~0.base|) (+ .cse19 3 |c_~#a~0.offset|) 0) (+ .cse19 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse23 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse23 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse23 |c_~#a~0.offset| 1) 0) (+ .cse23 2 |c_~#a~0.offset|) 0)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse23 3 |c_~#a~0.offset|) 0) (+ .cse23 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))) (= (select .cse14 .cse18) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse26 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse26 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse26 |c_~#a~0.offset| 1) 0) (+ .cse26 2 |c_~#a~0.offset|) 0)))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse27 |c_~#a~0.base| (store (store (select .cse27 |c_~#a~0.base|) (+ .cse26 3 |c_~#a~0.offset|) 0) (+ .cse26 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (= (select .cse14 .cse22) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse29 (let ((.cse31 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse30 |c_~#a~0.offset| 1) 0) (+ .cse30 2 |c_~#a~0.offset|) 0)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse29 |c_~#a~0.base| (store (store (select .cse29 |c_~#a~0.base|) (+ .cse30 3 |c_~#a~0.offset|) 0) (+ .cse30 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (not (= (select .cse0 (+ .cse30 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-29 02:10:44,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:48,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:50,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:10:52,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:01,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:03,286 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse22 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse18 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse7 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse7 |c_~#a~0.offset| 1) 0) (+ .cse7 2 |c_~#a~0.offset|) 0)))) (store .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse8 |c_~#a~0.base| (store (store (select .cse8 |c_~#a~0.base|) (+ .cse7 3 |c_~#a~0.offset|) 0) (+ .cse7 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse11 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse11 |c_~#a~0.offset| 1) 0) (+ .cse11 2 |c_~#a~0.offset|) 0)))) (store .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse12 |c_~#a~0.base| (store (store (select .cse12 |c_~#a~0.base|) (+ .cse11 3 |c_~#a~0.offset|) 0) (+ .cse11 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse14 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse14 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse14 |c_~#a~0.offset| 1) 0) (+ .cse14 2 |c_~#a~0.offset|) 0)))) (store .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse15 |c_~#a~0.base| (store (store (select .cse15 |c_~#a~0.base|) (+ .cse14 3 |c_~#a~0.offset|) 0) (+ .cse14 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse19 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse19 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse20 (let ((.cse21 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse19 |c_~#a~0.offset| 1) 0) (+ .cse19 2 |c_~#a~0.offset|) 0)))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse20 |c_~#a~0.base| (store (store (select .cse20 |c_~#a~0.base|) (+ .cse19 3 |c_~#a~0.offset|) 0) (+ .cse19 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse23 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse23 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse23 |c_~#a~0.offset| 1) 0) (+ .cse23 2 |c_~#a~0.offset|) 0)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse23 3 |c_~#a~0.offset|) 0) (+ .cse23 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse26 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse26 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse26 |c_~#a~0.offset| 1) 0) (+ .cse26 2 |c_~#a~0.offset|) 0)))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse27 |c_~#a~0.base| (store (store (select .cse27 |c_~#a~0.base|) (+ .cse26 3 |c_~#a~0.offset|) 0) (+ .cse26 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse29 (let ((.cse31 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse30 |c_~#a~0.offset| 1) 0) (+ .cse30 2 |c_~#a~0.offset|) 0)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse29 |c_~#a~0.base| (store (store (select .cse29 |c_~#a~0.base|) (+ .cse30 3 |c_~#a~0.offset|) 0) (+ .cse30 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (not (= (select .cse0 (+ .cse30 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse17) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse10 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) is different from true [2023-08-29 02:11:05,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:07,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:21,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:23,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:25,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:27,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:29,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:31,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:33,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:35,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:37,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:39,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:42,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:45,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:46,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:48,992 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse22 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse14 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse12 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22 0) .cse14 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse13 (select .cse12 |c_~#a~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse5 (select |c_#race| |c_~#a~0.base|)) (.cse18 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#a~0.base| (store (store .cse5 (+ .cse1 |c_~#a~0.offset| 1) 0) (+ .cse1 2 |c_~#a~0.offset|) 0)))) (store .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse2 |c_~#a~0.base| (store (store (select .cse2 |c_~#a~0.base|) (+ .cse1 3 |c_~#a~0.offset|) 0) (+ .cse1 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse6 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse6 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#a~0.base| (store (store .cse5 (+ .cse6 |c_~#a~0.offset| 1) 0) (+ .cse6 2 |c_~#a~0.offset|) 0)))) (store .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse7 |c_~#a~0.base| (store (store (select .cse7 |c_~#a~0.base|) (+ .cse6 3 |c_~#a~0.offset|) 0) (+ .cse6 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse9 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse9 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse10 (let ((.cse11 (store .cse12 |c_~#a~0.base| (store (store .cse13 (+ .cse9 |c_~#a~0.offset| 1) 0) (+ .cse9 2 |c_~#a~0.offset|) 0)))) (store .cse11 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse10 |c_~#a~0.base| (store (store (select .cse10 |c_~#a~0.base|) (+ .cse9 3 |c_~#a~0.offset|) 0) (+ .cse9 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse14)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse15 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse15 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store .cse12 |c_~#a~0.base| (store (store .cse13 (+ .cse15 |c_~#a~0.offset| 1) 0) (+ .cse15 2 |c_~#a~0.offset|) 0)))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse16 |c_~#a~0.base| (store (store (select .cse16 |c_~#a~0.base|) (+ .cse15 3 |c_~#a~0.offset|) 0) (+ .cse15 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse5 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse19 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse19 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse20 (let ((.cse21 (store |c_#race| |c_~#a~0.base| (store (store .cse5 (+ .cse19 |c_~#a~0.offset| 1) 0) (+ .cse19 2 |c_~#a~0.offset|) 0)))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse20 |c_~#a~0.base| (store (store (select .cse20 |c_~#a~0.base|) (+ .cse19 3 |c_~#a~0.offset|) 0) (+ .cse19 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse23 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse23 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store (store .cse5 (+ .cse23 |c_~#a~0.offset| 1) 0) (+ .cse23 2 |c_~#a~0.offset|) 0)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse23 3 |c_~#a~0.offset|) 0) (+ .cse23 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse14) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse5 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse27 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse26 (let ((.cse28 (store .cse12 |c_~#a~0.base| (store (store .cse13 (+ .cse27 |c_~#a~0.offset| 1) 0) (+ .cse27 2 |c_~#a~0.offset|) 0)))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse26 |c_~#a~0.base| (store (store (select .cse26 |c_~#a~0.base|) (+ .cse27 3 |c_~#a~0.offset|) 0) (+ .cse27 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse22) 0)) (not (= (select .cse0 (+ .cse27 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse29 (let ((.cse31 (store .cse12 |c_~#a~0.base| (store (store .cse13 (+ .cse30 |c_~#a~0.offset| 1) 0) (+ .cse30 2 |c_~#a~0.offset|) 0)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse29 |c_~#a~0.base| (store (store (select .cse29 |c_~#a~0.base|) (+ .cse30 3 |c_~#a~0.offset|) 0) (+ .cse30 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (not (= (select .cse0 (+ .cse30 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse5 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse14) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse5 .cse18 v_ArrVal_1544)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) is different from true [2023-08-29 02:11:51,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:53,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:55,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:57,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:11:59,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:01,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:10,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:13,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:14,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:17,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:19,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:21,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:23,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:25,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:27,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:29,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:31,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:33,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:35,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:37,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:39,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:41,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:45,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:47,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:49,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:51,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:53,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:55,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:57,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:12:59,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:01,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:03,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:05,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:07,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:09,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:12,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:14,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:16,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:18,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:20,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:22,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:23,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:25,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:28,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:30,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:31,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:33,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:35,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:37,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:39,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:42,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:44,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:48,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:50,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:52,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:54,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:57,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:13:59,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:01,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:03,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:05,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:07,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:09,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:12,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:20,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:22,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:24,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:26,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:28,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:30,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:32,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:34,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:36,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:38,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:40,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:42,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:44,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:46,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:48,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:50,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:53,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:14:59,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:15:01,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:15:03,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 02:15:05,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15