./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 BEFORE --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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 19:59:40,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 19:59:40,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 19:59:40,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 19:59:40,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 19:59:40,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 19:59:40,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 19:59:40,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 19:59:40,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 19:59:40,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 19:59:40,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 19:59:40,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 19:59:40,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 19:59:40,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 19:59:40,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 19:59:40,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 19:59:40,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 19:59:40,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 19:59:40,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 19:59:40,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 19:59:40,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 19:59:40,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 19:59:40,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 19:59:40,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 19:59:40,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 19:59:40,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 19:59:40,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 19:59:40,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 19:59:40,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 19:59:40,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 19:59:40,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 19:59:40,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 19:59:40,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 19:59:40,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 19:59:40,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 19:59:40,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 19:59:40,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 19:59:40,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 19:59:40,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 19:59:40,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 19:59:40,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 19:59:40,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-31 19:59:40,844 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 19:59:40,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 19:59:40,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 19:59:40,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 19:59:40,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 19:59:40,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 19:59:40,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 19:59:40,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 19:59:40,849 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 19:59:40,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 19:59:40,850 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 19:59:40,850 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 19:59:40,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 19:59:40,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 19:59:40,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 19:59:40,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 19:59:40,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 19:59:40,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 19:59:40,852 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-31 19:59:40,852 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 19:59:40,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 19:59:40,853 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 19:59:40,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 19:59:40,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 19:59:40,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 19:59:40,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 19:59:40,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 19:59:40,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 19:59:40,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 19:59:40,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 19:59:40,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 19:59:40,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 19:59:40,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 19:59:40,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 19:59:40,856 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 19:59:40,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 19:59:40,856 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 19:59:40,856 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 -> BEFORE [2023-08-31 19:59:41,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 19:59:41,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 19:59:41,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 19:59:41,231 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 19:59:41,232 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 19:59:41,233 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-31 19:59:42,441 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 19:59:42,685 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 19:59:42,686 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-31 19:59:42,702 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807de8484/51572fd9e62f4f458e4c27946816a4ec/FLAG764208982 [2023-08-31 19:59:42,716 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807de8484/51572fd9e62f4f458e4c27946816a4ec [2023-08-31 19:59:42,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 19:59:42,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 19:59:42,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 19:59:42,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 19:59:42,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 19:59:42,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 07:59:42" (1/1) ... [2023-08-31 19:59:42,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488ed725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:42, skipping insertion in model container [2023-08-31 19:59:42,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 07:59:42" (1/1) ... [2023-08-31 19:59:42,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 19:59:42,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 19:59:43,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 19:59:43,161 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 19:59:43,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 19:59:43,320 INFO L208 MainTranslator]: Completed translation [2023-08-31 19:59:43,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43 WrapperNode [2023-08-31 19:59:43,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 19:59:43,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 19:59:43,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 19:59:43,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 19:59:43,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,394 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2023-08-31 19:59:43,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 19:59:43,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 19:59:43,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 19:59:43,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 19:59:43,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 19:59:43,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 19:59:43,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 19:59:43,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 19:59:43,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (1/1) ... [2023-08-31 19:59:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 19:59:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 19:59:43,482 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-31 19:59:43,484 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-31 19:59:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 19:59:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 19:59:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 19:59:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 19:59:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-31 19:59:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 19:59:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-31 19:59:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-31 19:59:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 19:59:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 19:59:43,510 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 19:59:43,614 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 19:59:43,616 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 19:59:43,842 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 19:59:43,848 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 19:59:43,849 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-31 19:59:43,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 07:59:43 BoogieIcfgContainer [2023-08-31 19:59:43,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 19:59:43,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 19:59:43,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 19:59:43,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 19:59:43,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 07:59:42" (1/3) ... [2023-08-31 19:59:43,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385eb261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 07:59:43, skipping insertion in model container [2023-08-31 19:59:43,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 07:59:43" (2/3) ... [2023-08-31 19:59:43,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385eb261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 07:59:43, skipping insertion in model container [2023-08-31 19:59:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 07:59:43" (3/3) ... [2023-08-31 19:59:43,858 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2023-08-31 19:59:43,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 19:59:43,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 19:59:43,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-31 19:59:43,873 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 19:59:43,958 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 19:59:43,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 201 flow [2023-08-31 19:59:44,061 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-31 19:59:44,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 19:59:44,066 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-31 19:59:44,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 98 transitions, 201 flow [2023-08-31 19:59:44,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 97 transitions, 197 flow [2023-08-31 19:59:44,074 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 19:59:44,102 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-31 19:59:44,104 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 97 transitions, 197 flow [2023-08-31 19:59:44,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 97 transitions, 197 flow [2023-08-31 19:59:44,142 INFO L130 PetriNetUnfolder]: 4/97 cut-off events. [2023-08-31 19:59:44,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 19:59:44,144 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-31 19:59:44,146 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-31 19:59:45,886 INFO L134 LiptonReduction]: Checked pairs total: 7607 [2023-08-31 19:59:45,888 INFO L136 LiptonReduction]: Total number of compositions: 68 [2023-08-31 19:59:45,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 19:59:45,920 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;@36a424a0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 19:59:45,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-31 19:59:45,929 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2023-08-31 19:59:45,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 19:59:45,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:45,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:45,932 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-31 19:59:45,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1950365207, now seen corresponding path program 1 times [2023-08-31 19:59:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:45,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000322639] [2023-08-31 19:59:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:46,188 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-31 19:59:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000322639] [2023-08-31 19:59:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000322639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:46,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:46,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 19:59:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763883335] [2023-08-31 19:59:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:46,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 19:59:46,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:46,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 19:59:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 19:59:46,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 166 [2023-08-31 19:59:46,242 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-31 19:59:46,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:46,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 166 [2023-08-31 19:59:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:46,298 INFO L130 PetriNetUnfolder]: 31/148 cut-off events. [2023-08-31 19:59:46,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 19:59:46,299 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-31 19:59:46,301 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-31 19:59:46,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 109 flow [2023-08-31 19:59:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 19:59:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 19:59:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-31 19:59:46,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763052208835341 [2023-08-31 19:59:46,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-31 19:59:46,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-31 19:59:46,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:46,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-31 19:59:46,321 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-31 19:59:46,325 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-31 19:59:46,326 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-31 19:59:46,327 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 287 transitions. [2023-08-31 19:59:46,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 109 flow [2023-08-31 19:59:46,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 19:59:46,331 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-31 19:59:46,333 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-31 19:59:46,336 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-31 19:59:46,337 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-31 19:59:46,337 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-31 19:59:46,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:46,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:46,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 19:59:46,338 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-31 19:59:46,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1263490996, now seen corresponding path program 1 times [2023-08-31 19:59:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868696533] [2023-08-31 19:59:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:46,444 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-31 19:59:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868696533] [2023-08-31 19:59:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868696533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 19:59:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44830274] [2023-08-31 19:59:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:46,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 19:59:46,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 19:59:46,447 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-31 19:59:46,449 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-31 19:59:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:46,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 19:59:46,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 19:59:46,561 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-31 19:59:46,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 19:59:46,576 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-31 19:59:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44830274] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 19:59:46,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 19:59:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-31 19:59:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917315688] [2023-08-31 19:59:46,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 19:59:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 19:59:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 19:59:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-31 19:59:46,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-31 19:59:46,599 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-31 19:59:46,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:46,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-31 19:59:46,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:46,659 INFO L130 PetriNetUnfolder]: 31/151 cut-off events. [2023-08-31 19:59:46,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 19:59:46,660 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-31 19:59:46,661 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-31 19:59:46,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 136 flow [2023-08-31 19:59:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 19:59:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 19:59:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2023-08-31 19:59:46,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582329317269076 [2023-08-31 19:59:46,665 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 556 transitions. [2023-08-31 19:59:46,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 556 transitions. [2023-08-31 19:59:46,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:46,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 556 transitions. [2023-08-31 19:59:46,668 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-31 19:59:46,670 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-31 19:59:46,671 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-31 19:59:46,671 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 556 transitions. [2023-08-31 19:59:46,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 136 flow [2023-08-31 19:59:46,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 19:59:46,673 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-31 19:59:46,673 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-31 19:59:46,673 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-31 19:59:46,674 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-31 19:59:46,674 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-31 19:59:46,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:46,675 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:46,683 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-31 19:59:46,880 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-31 19:59:46,881 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-31 19:59:46,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1338651991, now seen corresponding path program 2 times [2023-08-31 19:59:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011910759] [2023-08-31 19:59:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:47,242 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-31 19:59:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011910759] [2023-08-31 19:59:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011910759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 19:59:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806505153] [2023-08-31 19:59:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:47,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 19:59:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 19:59:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 19:59:47,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 166 [2023-08-31 19:59:47,448 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-31 19:59:47,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:47,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 166 [2023-08-31 19:59:47,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:47,613 INFO L130 PetriNetUnfolder]: 148/371 cut-off events. [2023-08-31 19:59:47,613 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 19:59:47,616 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-31 19:59:47,620 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 50 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2023-08-31 19:59:47,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 344 flow [2023-08-31 19:59:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 19:59:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 19:59:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2023-08-31 19:59:47,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271084337349398 [2023-08-31 19:59:47,626 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 525 transitions. [2023-08-31 19:59:47,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 525 transitions. [2023-08-31 19:59:47,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:47,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 525 transitions. [2023-08-31 19:59:47,629 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-31 19:59:47,632 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-31 19:59:47,633 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-31 19:59:47,633 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 525 transitions. [2023-08-31 19:59:47,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 344 flow [2023-08-31 19:59:47,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 330 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-31 19:59:47,637 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-31 19:59:47,637 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-31 19:59:47,639 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-31 19:59:47,639 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-31 19:59:47,639 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-31 19:59:47,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:47,640 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:47,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 19:59:47,641 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-31 19:59:47,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2110106231, now seen corresponding path program 1 times [2023-08-31 19:59:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620109988] [2023-08-31 19:59:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:47,920 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-31 19:59:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620109988] [2023-08-31 19:59:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620109988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 19:59:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432872434] [2023-08-31 19:59:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 19:59:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:47,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 19:59:47,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 19:59:48,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 166 [2023-08-31 19:59:48,071 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-31 19:59:48,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:48,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 166 [2023-08-31 19:59:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:48,261 INFO L130 PetriNetUnfolder]: 188/465 cut-off events. [2023-08-31 19:59:48,264 INFO L131 PetriNetUnfolder]: For 133/137 co-relation queries the response was YES. [2023-08-31 19:59:48,266 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-31 19:59:48,268 INFO L137 encePairwiseOnDemand]: 155/166 looper letters, 65 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2023-08-31 19:59:48,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 546 flow [2023-08-31 19:59:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 19:59:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 19:59:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2023-08-31 19:59:48,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401606425702812 [2023-08-31 19:59:48,271 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 538 transitions. [2023-08-31 19:59:48,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 538 transitions. [2023-08-31 19:59:48,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:48,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 538 transitions. [2023-08-31 19:59:48,273 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-31 19:59:48,274 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-31 19:59:48,276 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-31 19:59:48,276 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 538 transitions. [2023-08-31 19:59:48,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 546 flow [2023-08-31 19:59:48,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 546 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 19:59:48,284 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-31 19:59:48,284 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-31 19:59:48,286 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-31 19:59:48,286 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-31 19:59:48,286 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-31 19:59:48,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:48,287 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:48,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 19:59:48,287 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-31 19:59:48,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1793987561, now seen corresponding path program 1 times [2023-08-31 19:59:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3131187] [2023-08-31 19:59:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:48,378 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-31 19:59:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3131187] [2023-08-31 19:59:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3131187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 19:59:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2620816] [2023-08-31 19:59:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:48,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 19:59:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 19:59:48,381 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-31 19:59:48,416 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-31 19:59:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:48,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 19:59:48,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 19:59:48,508 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-31 19:59:48,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 19:59:48,564 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-31 19:59:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2620816] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 19:59:48,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 19:59:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-31 19:59:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310699763] [2023-08-31 19:59:48,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 19:59:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 19:59:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 19:59:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-31 19:59:48,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 166 [2023-08-31 19:59:48,596 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-31 19:59:48,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:48,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 166 [2023-08-31 19:59:48,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:48,679 INFO L130 PetriNetUnfolder]: 116/356 cut-off events. [2023-08-31 19:59:48,680 INFO L131 PetriNetUnfolder]: For 271/274 co-relation queries the response was YES. [2023-08-31 19:59:48,681 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-31 19:59:48,683 INFO L137 encePairwiseOnDemand]: 163/166 looper letters, 21 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-31 19:59:48,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 538 flow [2023-08-31 19:59:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 19:59:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 19:59:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1099 transitions. [2023-08-31 19:59:48,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517068273092369 [2023-08-31 19:59:48,686 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1099 transitions. [2023-08-31 19:59:48,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1099 transitions. [2023-08-31 19:59:48,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:48,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1099 transitions. [2023-08-31 19:59:48,689 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-31 19:59:48,692 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-31 19:59:48,693 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-31 19:59:48,693 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1099 transitions. [2023-08-31 19:59:48,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 538 flow [2023-08-31 19:59:48,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 19:59:48,697 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-31 19:59:48,697 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-31 19:59:48,698 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-31 19:59:48,698 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-31 19:59:48,699 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-31 19:59:48,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:48,699 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:48,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-31 19:59:48,904 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-31 19:59:48,904 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-31 19:59:48,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash 46610167, now seen corresponding path program 2 times [2023-08-31 19:59:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083669579] [2023-08-31 19:59:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:48,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:49,299 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-31 19:59:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083669579] [2023-08-31 19:59:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083669579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 19:59:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119170154] [2023-08-31 19:59:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 19:59:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 19:59:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 19:59:49,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-31 19:59:49,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-31 19:59:49,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:49,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-31 19:59:49,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:49,588 INFO L130 PetriNetUnfolder]: 291/670 cut-off events. [2023-08-31 19:59:49,589 INFO L131 PetriNetUnfolder]: For 549/557 co-relation queries the response was YES. [2023-08-31 19:59:49,591 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-31 19:59:49,594 INFO L137 encePairwiseOnDemand]: 152/166 looper letters, 89 selfloop transitions, 49 changer transitions 8/151 dead transitions. [2023-08-31 19:59:49,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 151 transitions, 1078 flow [2023-08-31 19:59:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 19:59:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 19:59:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-08-31 19:59:49,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2023-08-31 19:59:49,596 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-08-31 19:59:49,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-08-31 19:59:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:49,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-08-31 19:59:49,598 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-31 19:59:49,600 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-31 19:59:49,600 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-31 19:59:49,600 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 508 transitions. [2023-08-31 19:59:49,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 151 transitions, 1078 flow [2023-08-31 19:59:49,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 151 transitions, 1030 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-31 19:59:49,606 INFO L231 Difference]: Finished difference. Result has 88 places, 131 transitions, 869 flow [2023-08-31 19:59:49,606 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-31 19:59:49,607 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2023-08-31 19:59:49,607 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 131 transitions, 869 flow [2023-08-31 19:59:49,608 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-31 19:59:49,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:49,608 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 19:59:49,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 19:59:49,608 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-31 19:59:49,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash -835319141, now seen corresponding path program 1 times [2023-08-31 19:59:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987715600] [2023-08-31 19:59:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:49,888 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-31 19:59:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:49,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987715600] [2023-08-31 19:59:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987715600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:49,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 19:59:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210148235] [2023-08-31 19:59:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:49,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 19:59:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:49,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 19:59:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 19:59:49,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 166 [2023-08-31 19:59:49,982 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-31 19:59:49,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:49,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 166 [2023-08-31 19:59:49,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:50,257 INFO L130 PetriNetUnfolder]: 350/802 cut-off events. [2023-08-31 19:59:50,258 INFO L131 PetriNetUnfolder]: For 1113/1132 co-relation queries the response was YES. [2023-08-31 19:59:50,261 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-31 19:59:50,264 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 124 selfloop transitions, 58 changer transitions 16/203 dead transitions. [2023-08-31 19:59:50,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 203 transitions, 1636 flow [2023-08-31 19:59:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 19:59:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 19:59:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2023-08-31 19:59:50,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230923694779116 [2023-08-31 19:59:50,267 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 521 transitions. [2023-08-31 19:59:50,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 521 transitions. [2023-08-31 19:59:50,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:50,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 521 transitions. [2023-08-31 19:59:50,269 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-31 19:59:50,270 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-31 19:59:50,270 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-31 19:59:50,270 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 869 flow. Second operand 6 states and 521 transitions. [2023-08-31 19:59:50,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 203 transitions, 1636 flow [2023-08-31 19:59:50,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 203 transitions, 1572 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-31 19:59:50,282 INFO L231 Difference]: Finished difference. Result has 98 places, 175 transitions, 1341 flow [2023-08-31 19:59:50,282 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-31 19:59:50,282 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2023-08-31 19:59:50,283 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 175 transitions, 1341 flow [2023-08-31 19:59:50,283 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-31 19:59:50,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:50,283 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-31 19:59:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 19:59:50,284 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-31 19:59:50,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1071622368, now seen corresponding path program 1 times [2023-08-31 19:59:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480705999] [2023-08-31 19:59:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:51,852 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-31 19:59:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480705999] [2023-08-31 19:59:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480705999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 19:59:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120487149] [2023-08-31 19:59:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:51,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 19:59:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 19:59:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-08-31 19:59:52,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-31 19:59:52,281 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-31 19:59:52,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:52,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-31 19:59:52,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:52,995 INFO L130 PetriNetUnfolder]: 603/1428 cut-off events. [2023-08-31 19:59:52,996 INFO L131 PetriNetUnfolder]: For 3094/3137 co-relation queries the response was YES. [2023-08-31 19:59:53,001 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-31 19:59:53,008 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 286 selfloop transitions, 81 changer transitions 41/436 dead transitions. [2023-08-31 19:59:53,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 436 transitions, 4051 flow [2023-08-31 19:59:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 19:59:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 19:59:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2023-08-31 19:59:53,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47200566973777464 [2023-08-31 19:59:53,013 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1332 transitions. [2023-08-31 19:59:53,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1332 transitions. [2023-08-31 19:59:53,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:53,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1332 transitions. [2023-08-31 19:59:53,047 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-31 19:59:53,051 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-31 19:59:53,052 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-31 19:59:53,052 INFO L175 Difference]: Start difference. First operand has 98 places, 175 transitions, 1341 flow. Second operand 17 states and 1332 transitions. [2023-08-31 19:59:53,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 436 transitions, 4051 flow [2023-08-31 19:59:53,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 436 transitions, 3909 flow, removed 71 selfloop flow, removed 0 redundant places. [2023-08-31 19:59:53,077 INFO L231 Difference]: Finished difference. Result has 127 places, 242 transitions, 2187 flow [2023-08-31 19:59:53,077 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-31 19:59:53,078 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2023-08-31 19:59:53,078 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 242 transitions, 2187 flow [2023-08-31 19:59:53,078 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-31 19:59:53,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:53,079 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-31 19:59:53,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 19:59:53,079 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-31 19:59:53,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1227228932, now seen corresponding path program 2 times [2023-08-31 19:59:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127454382] [2023-08-31 19:59:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 19:59:53,731 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-31 19:59:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 19:59:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127454382] [2023-08-31 19:59:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127454382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 19:59:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 19:59:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 19:59:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462262105] [2023-08-31 19:59:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 19:59:53,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 19:59:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 19:59:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 19:59:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-31 19:59:54,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-31 19:59:54,058 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-31 19:59:54,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 19:59:54,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-31 19:59:54,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 19:59:54,515 INFO L130 PetriNetUnfolder]: 608/1488 cut-off events. [2023-08-31 19:59:54,515 INFO L131 PetriNetUnfolder]: For 5062/5115 co-relation queries the response was YES. [2023-08-31 19:59:54,521 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-31 19:59:54,529 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 269 selfloop transitions, 83 changer transitions 29/409 dead transitions. [2023-08-31 19:59:54,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 409 transitions, 4201 flow [2023-08-31 19:59:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 19:59:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 19:59:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2023-08-31 19:59:54,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.499330655957162 [2023-08-31 19:59:54,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2023-08-31 19:59:54,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2023-08-31 19:59:54,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 19:59:54,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2023-08-31 19:59:54,534 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-31 19:59:54,536 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-31 19:59:54,537 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-31 19:59:54,537 INFO L175 Difference]: Start difference. First operand has 127 places, 242 transitions, 2187 flow. Second operand 9 states and 746 transitions. [2023-08-31 19:59:54,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 409 transitions, 4201 flow [2023-08-31 19:59:54,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 409 transitions, 4187 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-31 19:59:54,576 INFO L231 Difference]: Finished difference. Result has 141 places, 276 transitions, 2871 flow [2023-08-31 19:59:54,576 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-31 19:59:54,577 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 102 predicate places. [2023-08-31 19:59:54,577 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 276 transitions, 2871 flow [2023-08-31 19:59:54,578 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-31 19:59:54,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 19:59:54,578 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-31 19:59:54,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 19:59:54,578 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-31 19:59:54,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 19:59:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -535616722, now seen corresponding path program 1 times [2023-08-31 19:59:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 19:59:54,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376512289] [2023-08-31 19:59:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 19:59:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 19:59:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:00,893 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-31 20:00:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376512289] [2023-08-31 20:00:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376512289] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 20:00:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181897897] [2023-08-31 20:00:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 20:00:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 20:00:00,897 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-31 20:00:00,901 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-31 20:00:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:01,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 20:00:01,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 20:00:01,164 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-31 20:00:01,268 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-31 20:00:01,271 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-31 20:00:01,326 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-31 20:00:01,382 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-31 20:00:01,446 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-31 20:00:01,518 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-31 20:00:01,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:00:01,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:00:01,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:00:01,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 20:00:01,642 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-31 20:00:04,806 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-31 20:00:04,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 20:00:10,829 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-31 20:00:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181897897] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 20:00:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 20:00:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18, 13] total 38 [2023-08-31 20:00:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949732101] [2023-08-31 20:00:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:10,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:10,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:10,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1308, Unknown=2, NotChecked=0, Total=1482 [2023-08-31 20:00:13,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:00:13,278 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-31 20:00:13,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:13,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:00:13,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:22,350 INFO L130 PetriNetUnfolder]: 593/1472 cut-off events. [2023-08-31 20:00:22,350 INFO L131 PetriNetUnfolder]: For 7095/7151 co-relation queries the response was YES. [2023-08-31 20:00:22,358 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-31 20:00:22,366 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 281 selfloop transitions, 83 changer transitions 42/469 dead transitions. [2023-08-31 20:00:22,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 469 transitions, 5146 flow [2023-08-31 20:00:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 20:00:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 20:00:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1198 transitions. [2023-08-31 20:00:22,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811244979919679 [2023-08-31 20:00:22,370 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1198 transitions. [2023-08-31 20:00:22,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1198 transitions. [2023-08-31 20:00:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:22,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1198 transitions. [2023-08-31 20:00:22,374 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-31 20:00:22,377 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-31 20:00:22,378 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-31 20:00:22,378 INFO L175 Difference]: Start difference. First operand has 141 places, 276 transitions, 2871 flow. Second operand 15 states and 1198 transitions. [2023-08-31 20:00:22,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 469 transitions, 5146 flow [2023-08-31 20:00:22,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 469 transitions, 5082 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-31 20:00:22,433 INFO L231 Difference]: Finished difference. Result has 165 places, 332 transitions, 3674 flow [2023-08-31 20:00:22,433 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-31 20:00:22,434 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 126 predicate places. [2023-08-31 20:00:22,434 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 332 transitions, 3674 flow [2023-08-31 20:00:22,435 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-31 20:00:22,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:22,435 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-31 20:00:22,443 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-31 20:00:22,640 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-31 20:00:22,641 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-31 20:00:22,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 448036598, now seen corresponding path program 3 times [2023-08-31 20:00:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892831409] [2023-08-31 20:00:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:23,361 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-31 20:00:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892831409] [2023-08-31 20:00:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892831409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:23,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162997616] [2023-08-31 20:00:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:23,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:23,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:23,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:00:23,862 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-31 20:00:23,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:23,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:00:23,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:24,749 INFO L130 PetriNetUnfolder]: 587/1453 cut-off events. [2023-08-31 20:00:24,749 INFO L131 PetriNetUnfolder]: For 8427/8485 co-relation queries the response was YES. [2023-08-31 20:00:24,755 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-31 20:00:24,762 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 293 selfloop transitions, 86 changer transitions 36/456 dead transitions. [2023-08-31 20:00:24,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 456 transitions, 5489 flow [2023-08-31 20:00:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 20:00:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 20:00:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1193 transitions. [2023-08-31 20:00:24,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791164658634538 [2023-08-31 20:00:24,769 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1193 transitions. [2023-08-31 20:00:24,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1193 transitions. [2023-08-31 20:00:24,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:24,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1193 transitions. [2023-08-31 20:00:24,776 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-31 20:00:24,779 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-31 20:00:24,780 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-31 20:00:24,780 INFO L175 Difference]: Start difference. First operand has 165 places, 332 transitions, 3674 flow. Second operand 15 states and 1193 transitions. [2023-08-31 20:00:24,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 456 transitions, 5489 flow [2023-08-31 20:00:24,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 456 transitions, 5463 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-31 20:00:24,848 INFO L231 Difference]: Finished difference. Result has 176 places, 342 transitions, 4074 flow [2023-08-31 20:00:24,849 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-31 20:00:24,849 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 137 predicate places. [2023-08-31 20:00:24,849 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 342 transitions, 4074 flow [2023-08-31 20:00:24,850 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-31 20:00:24,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:24,850 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-31 20:00:24,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 20:00:24,850 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-31 20:00:24,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -308912082, now seen corresponding path program 2 times [2023-08-31 20:00:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732868738] [2023-08-31 20:00:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:26,051 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-31 20:00:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732868738] [2023-08-31 20:00:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732868738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:26,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 20:00:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740375065] [2023-08-31 20:00:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:26,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 20:00:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 20:00:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 20:00:26,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 166 [2023-08-31 20:00:26,600 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-31 20:00:26,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:26,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 166 [2023-08-31 20:00:26,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:27,551 INFO L130 PetriNetUnfolder]: 624/1531 cut-off events. [2023-08-31 20:00:27,551 INFO L131 PetriNetUnfolder]: For 11050/11128 co-relation queries the response was YES. [2023-08-31 20:00:27,614 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-31 20:00:27,623 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 261 selfloop transitions, 114 changer transitions 36/459 dead transitions. [2023-08-31 20:00:27,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 459 transitions, 6144 flow [2023-08-31 20:00:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 20:00:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 20:00:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 803 transitions. [2023-08-31 20:00:27,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48373493975903614 [2023-08-31 20:00:27,628 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 803 transitions. [2023-08-31 20:00:27,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 803 transitions. [2023-08-31 20:00:27,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:27,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 803 transitions. [2023-08-31 20:00:27,632 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-31 20:00:27,635 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-31 20:00:27,636 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-31 20:00:27,636 INFO L175 Difference]: Start difference. First operand has 176 places, 342 transitions, 4074 flow. Second operand 10 states and 803 transitions. [2023-08-31 20:00:27,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 459 transitions, 6144 flow [2023-08-31 20:00:27,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 459 transitions, 5984 flow, removed 41 selfloop flow, removed 4 redundant places. [2023-08-31 20:00:27,698 INFO L231 Difference]: Finished difference. Result has 185 places, 366 transitions, 4796 flow [2023-08-31 20:00:27,699 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-31 20:00:27,700 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 146 predicate places. [2023-08-31 20:00:27,702 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 366 transitions, 4796 flow [2023-08-31 20:00:27,703 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-31 20:00:27,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:27,703 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-31 20:00:27,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 20:00:27,703 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-31 20:00:27,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1222085252, now seen corresponding path program 3 times [2023-08-31 20:00:27,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:27,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664466822] [2023-08-31 20:00:27,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:27,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:28,378 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-31 20:00:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664466822] [2023-08-31 20:00:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664466822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:28,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049752867] [2023-08-31 20:00:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:28,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:28,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:00:28,901 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-31 20:00:28,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:28,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:00:28,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:29,853 INFO L130 PetriNetUnfolder]: 613/1529 cut-off events. [2023-08-31 20:00:29,853 INFO L131 PetriNetUnfolder]: For 14024/14094 co-relation queries the response was YES. [2023-08-31 20:00:29,861 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-31 20:00:29,869 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 312 selfloop transitions, 104 changer transitions 25/506 dead transitions. [2023-08-31 20:00:29,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 506 transitions, 6965 flow [2023-08-31 20:00:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 20:00:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 20:00:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 825 transitions. [2023-08-31 20:00:29,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49698795180722893 [2023-08-31 20:00:29,871 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 825 transitions. [2023-08-31 20:00:29,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 825 transitions. [2023-08-31 20:00:29,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:29,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 825 transitions. [2023-08-31 20:00:29,873 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-31 20:00:29,876 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-31 20:00:29,876 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-31 20:00:29,876 INFO L175 Difference]: Start difference. First operand has 185 places, 366 transitions, 4796 flow. Second operand 10 states and 825 transitions. [2023-08-31 20:00:29,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 506 transitions, 6965 flow [2023-08-31 20:00:29,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 506 transitions, 6905 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 20:00:29,956 INFO L231 Difference]: Finished difference. Result has 195 places, 390 transitions, 5454 flow [2023-08-31 20:00:29,956 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-31 20:00:29,956 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 156 predicate places. [2023-08-31 20:00:29,957 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 390 transitions, 5454 flow [2023-08-31 20:00:29,957 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-31 20:00:29,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:29,957 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-31 20:00:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 20:00:29,957 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-31 20:00:29,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2052644462, now seen corresponding path program 4 times [2023-08-31 20:00:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602848326] [2023-08-31 20:00:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:31,461 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-31 20:00:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602848326] [2023-08-31 20:00:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602848326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-31 20:00:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895658697] [2023-08-31 20:00:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:31,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 20:00:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 20:00:31,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-31 20:00:32,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-08-31 20:00:32,115 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-31 20:00:32,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:32,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-08-31 20:00:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:33,377 INFO L130 PetriNetUnfolder]: 692/1704 cut-off events. [2023-08-31 20:00:33,377 INFO L131 PetriNetUnfolder]: For 18631/18717 co-relation queries the response was YES. [2023-08-31 20:00:33,384 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-31 20:00:33,392 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 287 selfloop transitions, 165 changer transitions 21/521 dead transitions. [2023-08-31 20:00:33,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 521 transitions, 8031 flow [2023-08-31 20:00:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 20:00:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 20:00:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2023-08-31 20:00:33,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2023-08-31 20:00:33,399 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 936 transitions. [2023-08-31 20:00:33,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 936 transitions. [2023-08-31 20:00:33,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:33,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 936 transitions. [2023-08-31 20:00:33,403 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-31 20:00:33,407 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-31 20:00:33,407 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-31 20:00:33,407 INFO L175 Difference]: Start difference. First operand has 195 places, 390 transitions, 5454 flow. Second operand 12 states and 936 transitions. [2023-08-31 20:00:33,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 521 transitions, 8031 flow [2023-08-31 20:00:33,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 521 transitions, 7959 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-08-31 20:00:33,479 INFO L231 Difference]: Finished difference. Result has 214 places, 436 transitions, 6857 flow [2023-08-31 20:00:33,479 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-31 20:00:33,480 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 175 predicate places. [2023-08-31 20:00:33,480 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 436 transitions, 6857 flow [2023-08-31 20:00:33,480 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-31 20:00:33,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:33,480 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-31 20:00:33,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 20:00:33,480 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-31 20:00:33,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2135421222, now seen corresponding path program 1 times [2023-08-31 20:00:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:33,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330104633] [2023-08-31 20:00:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:34,032 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-31 20:00:34,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:34,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330104633] [2023-08-31 20:00:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330104633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:34,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:34,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811314071] [2023-08-31 20:00:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:34,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:34,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:34,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:34,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:00:34,427 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-31 20:00:34,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:34,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:00:34,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:35,207 INFO L130 PetriNetUnfolder]: 808/1923 cut-off events. [2023-08-31 20:00:35,207 INFO L131 PetriNetUnfolder]: For 26893/26933 co-relation queries the response was YES. [2023-08-31 20:00:35,214 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-31 20:00:35,221 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 312 selfloop transitions, 168 changer transitions 29/514 dead transitions. [2023-08-31 20:00:35,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 514 transitions, 8742 flow [2023-08-31 20:00:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 20:00:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 20:00:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 617 transitions. [2023-08-31 20:00:35,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46460843373493976 [2023-08-31 20:00:35,222 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 617 transitions. [2023-08-31 20:00:35,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 617 transitions. [2023-08-31 20:00:35,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:35,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 617 transitions. [2023-08-31 20:00:35,224 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-31 20:00:35,225 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-31 20:00:35,226 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-31 20:00:35,226 INFO L175 Difference]: Start difference. First operand has 214 places, 436 transitions, 6857 flow. Second operand 8 states and 617 transitions. [2023-08-31 20:00:35,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 514 transitions, 8742 flow [2023-08-31 20:00:35,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 514 transitions, 8641 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-31 20:00:35,327 INFO L231 Difference]: Finished difference. Result has 222 places, 453 transitions, 7397 flow [2023-08-31 20:00:35,327 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-31 20:00:35,328 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 183 predicate places. [2023-08-31 20:00:35,328 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 453 transitions, 7397 flow [2023-08-31 20:00:35,328 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-31 20:00:35,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:35,328 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-31 20:00:35,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 20:00:35,329 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-31 20:00:35,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 275868054, now seen corresponding path program 5 times [2023-08-31 20:00:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:35,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614217147] [2023-08-31 20:00:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:35,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:36,390 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-31 20:00:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614217147] [2023-08-31 20:00:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614217147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621045467] [2023-08-31 20:00:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:36,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:36,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:00:36,900 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-31 20:00:36,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:36,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:00:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:37,877 INFO L130 PetriNetUnfolder]: 749/1848 cut-off events. [2023-08-31 20:00:37,878 INFO L131 PetriNetUnfolder]: For 30104/30209 co-relation queries the response was YES. [2023-08-31 20:00:37,887 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-31 20:00:37,896 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 325 selfloop transitions, 177 changer transitions 23/599 dead transitions. [2023-08-31 20:00:37,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 599 transitions, 10531 flow [2023-08-31 20:00:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 20:00:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 20:00:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2023-08-31 20:00:37,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49866131191432395 [2023-08-31 20:00:37,898 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2023-08-31 20:00:37,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2023-08-31 20:00:37,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:37,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2023-08-31 20:00:37,900 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-31 20:00:37,901 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-31 20:00:37,902 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-31 20:00:37,902 INFO L175 Difference]: Start difference. First operand has 222 places, 453 transitions, 7397 flow. Second operand 9 states and 745 transitions. [2023-08-31 20:00:37,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 599 transitions, 10531 flow [2023-08-31 20:00:38,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 599 transitions, 10390 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 20:00:38,076 INFO L231 Difference]: Finished difference. Result has 235 places, 502 transitions, 9025 flow [2023-08-31 20:00:38,076 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-31 20:00:38,078 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2023-08-31 20:00:38,078 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 502 transitions, 9025 flow [2023-08-31 20:00:38,078 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-31 20:00:38,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:38,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-31 20:00:38,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 20:00:38,079 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-31 20:00:38,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 339846000, now seen corresponding path program 2 times [2023-08-31 20:00:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844948416] [2023-08-31 20:00:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:38,582 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-31 20:00:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844948416] [2023-08-31 20:00:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844948416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472865619] [2023-08-31 20:00:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:38,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:38,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:00:38,938 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-31 20:00:38,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:38,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:00:38,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:39,972 INFO L130 PetriNetUnfolder]: 893/2125 cut-off events. [2023-08-31 20:00:39,972 INFO L131 PetriNetUnfolder]: For 41007/41060 co-relation queries the response was YES. [2023-08-31 20:00:39,983 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-31 20:00:39,993 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 362 selfloop transitions, 183 changer transitions 13/563 dead transitions. [2023-08-31 20:00:39,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 563 transitions, 10851 flow [2023-08-31 20:00:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 20:00:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 20:00:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 604 transitions. [2023-08-31 20:00:39,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45481927710843373 [2023-08-31 20:00:39,995 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 604 transitions. [2023-08-31 20:00:39,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 604 transitions. [2023-08-31 20:00:39,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:39,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 604 transitions. [2023-08-31 20:00:39,997 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-31 20:00:39,999 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-31 20:00:39,999 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-31 20:00:39,999 INFO L175 Difference]: Start difference. First operand has 235 places, 502 transitions, 9025 flow. Second operand 8 states and 604 transitions. [2023-08-31 20:00:39,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 563 transitions, 10851 flow [2023-08-31 20:00:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 563 transitions, 10769 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-31 20:00:40,235 INFO L231 Difference]: Finished difference. Result has 245 places, 523 transitions, 9809 flow [2023-08-31 20:00:40,236 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-31 20:00:40,236 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 206 predicate places. [2023-08-31 20:00:40,236 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 523 transitions, 9809 flow [2023-08-31 20:00:40,237 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-31 20:00:40,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:40,237 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-31 20:00:40,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 20:00:40,237 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-31 20:00:40,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1652558750, now seen corresponding path program 3 times [2023-08-31 20:00:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801336022] [2023-08-31 20:00:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:40,624 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-31 20:00:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801336022] [2023-08-31 20:00:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801336022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:40,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:40,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521126101] [2023-08-31 20:00:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:40,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:40,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:40,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:40,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:00:40,929 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-31 20:00:40,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:40,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:00:40,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:42,099 INFO L130 PetriNetUnfolder]: 907/2157 cut-off events. [2023-08-31 20:00:42,100 INFO L131 PetriNetUnfolder]: For 46752/46811 co-relation queries the response was YES. [2023-08-31 20:00:42,109 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-31 20:00:42,120 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 397 selfloop transitions, 244 changer transitions 22/668 dead transitions. [2023-08-31 20:00:42,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 668 transitions, 12670 flow [2023-08-31 20:00:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 20:00:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 20:00:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1034 transitions. [2023-08-31 20:00:42,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47914735866543096 [2023-08-31 20:00:42,122 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1034 transitions. [2023-08-31 20:00:42,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1034 transitions. [2023-08-31 20:00:42,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:42,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1034 transitions. [2023-08-31 20:00:42,125 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-31 20:00:42,127 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-31 20:00:42,127 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-31 20:00:42,127 INFO L175 Difference]: Start difference. First operand has 245 places, 523 transitions, 9809 flow. Second operand 13 states and 1034 transitions. [2023-08-31 20:00:42,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 668 transitions, 12670 flow [2023-08-31 20:00:42,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 668 transitions, 12620 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-31 20:00:42,403 INFO L231 Difference]: Finished difference. Result has 260 places, 563 transitions, 11041 flow [2023-08-31 20:00:42,404 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-31 20:00:42,405 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 221 predicate places. [2023-08-31 20:00:42,405 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 563 transitions, 11041 flow [2023-08-31 20:00:42,405 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-31 20:00:42,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:42,405 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-31 20:00:42,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 20:00:42,406 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-31 20:00:42,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 382165376, now seen corresponding path program 4 times [2023-08-31 20:00:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16777227] [2023-08-31 20:00:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:43,041 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-31 20:00:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16777227] [2023-08-31 20:00:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16777227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-08-31 20:00:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643573635] [2023-08-31 20:00:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:43,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 20:00:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 20:00:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-08-31 20:00:43,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 166 [2023-08-31 20:00:43,732 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-31 20:00:43,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:43,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 166 [2023-08-31 20:00:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:45,854 INFO L130 PetriNetUnfolder]: 1413/3198 cut-off events. [2023-08-31 20:00:45,854 INFO L131 PetriNetUnfolder]: For 71060/71132 co-relation queries the response was YES. [2023-08-31 20:00:45,872 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-31 20:00:45,884 INFO L137 encePairwiseOnDemand]: 145/166 looper letters, 768 selfloop transitions, 253 changer transitions 25/1050 dead transitions. [2023-08-31 20:00:45,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1050 transitions, 21132 flow [2023-08-31 20:00:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 20:00:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 20:00:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1451 transitions. [2023-08-31 20:00:45,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41623637406769937 [2023-08-31 20:00:45,887 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1451 transitions. [2023-08-31 20:00:45,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1451 transitions. [2023-08-31 20:00:45,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:45,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1451 transitions. [2023-08-31 20:00:45,890 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-31 20:00:45,893 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-31 20:00:45,894 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-31 20:00:45,894 INFO L175 Difference]: Start difference. First operand has 260 places, 563 transitions, 11041 flow. Second operand 21 states and 1451 transitions. [2023-08-31 20:00:45,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1050 transitions, 21132 flow [2023-08-31 20:00:46,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1050 transitions, 20728 flow, removed 198 selfloop flow, removed 1 redundant places. [2023-08-31 20:00:46,225 INFO L231 Difference]: Finished difference. Result has 292 places, 741 transitions, 15065 flow [2023-08-31 20:00:46,225 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-31 20:00:46,226 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2023-08-31 20:00:46,226 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 741 transitions, 15065 flow [2023-08-31 20:00:46,226 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-31 20:00:46,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:46,227 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-31 20:00:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 20:00:46,227 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-31 20:00:46,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1639249436, now seen corresponding path program 6 times [2023-08-31 20:00:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470998778] [2023-08-31 20:00:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:46,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:00:47,377 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-31 20:00:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:00:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470998778] [2023-08-31 20:00:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470998778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:00:47,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:00:47,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:00:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915507349] [2023-08-31 20:00:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:00:47,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:00:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:00:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:00:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:00:48,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:00:48,056 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-31 20:00:48,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:00:48,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:00:48,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:00:49,408 INFO L130 PetriNetUnfolder]: 1119/2750 cut-off events. [2023-08-31 20:00:49,408 INFO L131 PetriNetUnfolder]: For 78997/79280 co-relation queries the response was YES. [2023-08-31 20:00:49,426 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-31 20:00:49,435 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 480 selfloop transitions, 225 changer transitions 21/867 dead transitions. [2023-08-31 20:00:49,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 867 transitions, 18594 flow [2023-08-31 20:00:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 20:00:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 20:00:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-31 20:00:49,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-31 20:00:49,437 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-31 20:00:49,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-31 20:00:49,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:00:49,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-31 20:00:49,439 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-31 20:00:49,441 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-31 20:00:49,441 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-31 20:00:49,441 INFO L175 Difference]: Start difference. First operand has 292 places, 741 transitions, 15065 flow. Second operand 9 states and 743 transitions. [2023-08-31 20:00:49,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 867 transitions, 18594 flow [2023-08-31 20:00:49,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 867 transitions, 18504 flow, removed 45 selfloop flow, removed 0 redundant places. [2023-08-31 20:00:49,749 INFO L231 Difference]: Finished difference. Result has 306 places, 779 transitions, 16974 flow [2023-08-31 20:00:49,749 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-31 20:00:49,749 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 267 predicate places. [2023-08-31 20:00:49,750 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 779 transitions, 16974 flow [2023-08-31 20:00:49,750 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-31 20:00:49,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:00:49,750 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-31 20:00:49,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 20:00:49,750 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-31 20:00:49,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:00:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1834866135, now seen corresponding path program 1 times [2023-08-31 20:00:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:00:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138274550] [2023-08-31 20:00:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:00:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:00:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:02:31,502 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-31 20:02:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:02:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138274550] [2023-08-31 20:02:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138274550] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 20:02:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394541044] [2023-08-31 20:02:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:02:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 20:02:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 20:02:31,507 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-31 20:02:31,507 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-31 20:02:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:02:31,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-31 20:02:31,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 20:02:31,741 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-31 20:02:31,785 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-31 20:02:31,785 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-31 20:02:31,910 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-31 20:02:31,977 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-31 20:02:32,052 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-31 20:02:32,155 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-31 20:02:32,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:02:32,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 20:02:32,264 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-31 20:02:32,280 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-31 20:02:32,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 20:02:33,604 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-31 20:02:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394541044] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 20:02:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 20:02:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 11] total 35 [2023-08-31 20:02:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981703193] [2023-08-31 20:02:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:02:33,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:02:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:02:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:02:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2023-08-31 20:02:36,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:02:36,012 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-31 20:02:36,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:02:36,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:02:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:02:40,417 INFO L130 PetriNetUnfolder]: 1261/3030 cut-off events. [2023-08-31 20:02:40,417 INFO L131 PetriNetUnfolder]: For 93037/93215 co-relation queries the response was YES. [2023-08-31 20:02:40,440 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-31 20:02:40,453 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 687 selfloop transitions, 196 changer transitions 44/937 dead transitions. [2023-08-31 20:02:40,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 937 transitions, 21274 flow [2023-08-31 20:02:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 20:02:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 20:02:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1131 transitions. [2023-08-31 20:02:40,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542168674698795 [2023-08-31 20:02:40,455 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1131 transitions. [2023-08-31 20:02:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1131 transitions. [2023-08-31 20:02:40,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:02:40,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1131 transitions. [2023-08-31 20:02:40,457 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-31 20:02:40,460 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-31 20:02:40,460 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-31 20:02:40,460 INFO L175 Difference]: Start difference. First operand has 306 places, 779 transitions, 16974 flow. Second operand 15 states and 1131 transitions. [2023-08-31 20:02:40,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 937 transitions, 21274 flow [2023-08-31 20:02:40,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 937 transitions, 21157 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-31 20:02:40,887 INFO L231 Difference]: Finished difference. Result has 326 places, 838 transitions, 18400 flow [2023-08-31 20:02:40,888 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-31 20:02:40,888 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 287 predicate places. [2023-08-31 20:02:40,888 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 838 transitions, 18400 flow [2023-08-31 20:02:40,888 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-31 20:02:40,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:02:40,888 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-31 20:02:40,893 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-31 20:02:41,089 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-31 20:02:41,089 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-31 20:02:41,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:02:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 643269942, now seen corresponding path program 5 times [2023-08-31 20:02:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:02:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798075100] [2023-08-31 20:02:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:02:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:02:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:02:43,883 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-31 20:02:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:02:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798075100] [2023-08-31 20:02:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798075100] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 20:02:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124570048] [2023-08-31 20:02:43,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 20:02:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 20:02:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 20:02:43,885 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-31 20:02:43,886 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-31 20:02:44,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-31 20:02:44,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 20:02:44,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-31 20:02:44,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 20:02:44,232 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-31 20:02:44,280 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-31 20:02:44,280 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-31 20:02:44,391 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-31 20:02:44,454 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-31 20:02:44,539 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-31 20:02:44,625 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-31 20:02:44,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:02:44,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:02:44,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:02:44,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 20:02:44,729 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-31 20:02:50,851 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-31 20:02:50,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 20:02:54,186 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-31 20:02:54,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124570048] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 20:02:54,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 20:02:54,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 16] total 41 [2023-08-31 20:02:54,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366403116] [2023-08-31 20:02:54,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:02:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:02:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:02:54,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:02:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1537, Unknown=3, NotChecked=0, Total=1722 [2023-08-31 20:02:55,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:02:55,870 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-31 20:02:55,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:02:55,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:02:55,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:03:01,952 INFO L130 PetriNetUnfolder]: 1284/3055 cut-off events. [2023-08-31 20:03:01,952 INFO L131 PetriNetUnfolder]: For 96219/96287 co-relation queries the response was YES. [2023-08-31 20:03:01,976 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-31 20:03:01,988 INFO L137 encePairwiseOnDemand]: 150/166 looper letters, 555 selfloop transitions, 335 changer transitions 14/914 dead transitions. [2023-08-31 20:03:01,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 914 transitions, 21360 flow [2023-08-31 20:03:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 20:03:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 20:03:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 716 transitions. [2023-08-31 20:03:01,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47925033467202144 [2023-08-31 20:03:01,989 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 716 transitions. [2023-08-31 20:03:01,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 716 transitions. [2023-08-31 20:03:01,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:03:01,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 716 transitions. [2023-08-31 20:03:01,991 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-31 20:03:01,992 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-31 20:03:01,993 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-31 20:03:01,993 INFO L175 Difference]: Start difference. First operand has 326 places, 838 transitions, 18400 flow. Second operand 9 states and 716 transitions. [2023-08-31 20:03:01,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 914 transitions, 21360 flow [2023-08-31 20:03:02,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 914 transitions, 21150 flow, removed 101 selfloop flow, removed 3 redundant places. [2023-08-31 20:03:02,493 INFO L231 Difference]: Finished difference. Result has 329 places, 859 transitions, 19464 flow [2023-08-31 20:03:02,494 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-31 20:03:02,494 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 290 predicate places. [2023-08-31 20:03:02,494 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 859 transitions, 19464 flow [2023-08-31 20:03:02,495 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-31 20:03:02,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:03:02,495 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-31 20:03:02,501 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-31 20:03:02,700 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-31 20:03:02,701 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-31 20:03:02,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:03:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1293712730, now seen corresponding path program 6 times [2023-08-31 20:03:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:03:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346655235] [2023-08-31 20:03:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:03:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:03:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:03:03,070 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-31 20:03:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:03:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346655235] [2023-08-31 20:03:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346655235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:03:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:03:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:03:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514635075] [2023-08-31 20:03:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:03:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:03:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:03:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:03:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:03:03,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:03:03,365 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-31 20:03:03,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:03:03,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:03:03,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:03:04,712 INFO L130 PetriNetUnfolder]: 1285/3058 cut-off events. [2023-08-31 20:03:04,712 INFO L131 PetriNetUnfolder]: For 101093/101157 co-relation queries the response was YES. [2023-08-31 20:03:04,733 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-31 20:03:04,744 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 535 selfloop transitions, 347 changer transitions 22/914 dead transitions. [2023-08-31 20:03:04,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 914 transitions, 21999 flow [2023-08-31 20:03:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 20:03:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 20:03:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 626 transitions. [2023-08-31 20:03:04,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713855421686747 [2023-08-31 20:03:04,746 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 626 transitions. [2023-08-31 20:03:04,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 626 transitions. [2023-08-31 20:03:04,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:03:04,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 626 transitions. [2023-08-31 20:03:04,747 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-31 20:03:04,748 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-31 20:03:04,749 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-31 20:03:04,749 INFO L175 Difference]: Start difference. First operand has 329 places, 859 transitions, 19464 flow. Second operand 8 states and 626 transitions. [2023-08-31 20:03:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 914 transitions, 21999 flow [2023-08-31 20:03:05,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 914 transitions, 21595 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-31 20:03:05,268 INFO L231 Difference]: Finished difference. Result has 331 places, 861 transitions, 19872 flow [2023-08-31 20:03:05,269 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-31 20:03:05,269 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 292 predicate places. [2023-08-31 20:03:05,270 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 861 transitions, 19872 flow [2023-08-31 20:03:05,270 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-31 20:03:05,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:03:05,270 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-31 20:03:05,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 20:03:05,270 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-31 20:03:05,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:03:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1414769900, now seen corresponding path program 7 times [2023-08-31 20:03:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:03:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731119833] [2023-08-31 20:03:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:03:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:03:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:03:05,694 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-31 20:03:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:03:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731119833] [2023-08-31 20:03:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731119833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:03:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:03:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:03:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143594684] [2023-08-31 20:03:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:03:05,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:03:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:03:05,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:03:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:03:05,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 166 [2023-08-31 20:03:05,965 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-31 20:03:05,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:03:05,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 166 [2023-08-31 20:03:05,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:03:07,613 INFO L130 PetriNetUnfolder]: 1282/3053 cut-off events. [2023-08-31 20:03:07,613 INFO L131 PetriNetUnfolder]: For 101660/101749 co-relation queries the response was YES. [2023-08-31 20:03:07,637 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-31 20:03:07,649 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 533 selfloop transitions, 353 changer transitions 21/917 dead transitions. [2023-08-31 20:03:07,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 917 transitions, 22443 flow [2023-08-31 20:03:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 20:03:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 20:03:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 694 transitions. [2023-08-31 20:03:07,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464524765729585 [2023-08-31 20:03:07,651 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 694 transitions. [2023-08-31 20:03:07,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 694 transitions. [2023-08-31 20:03:07,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:03:07,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 694 transitions. [2023-08-31 20:03:07,653 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-31 20:03:07,654 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-31 20:03:07,654 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-31 20:03:07,654 INFO L175 Difference]: Start difference. First operand has 331 places, 861 transitions, 19872 flow. Second operand 9 states and 694 transitions. [2023-08-31 20:03:07,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 917 transitions, 22443 flow [2023-08-31 20:03:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 917 transitions, 21850 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 20:03:08,295 INFO L231 Difference]: Finished difference. Result has 338 places, 865 transitions, 20205 flow [2023-08-31 20:03:08,296 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-31 20:03:08,297 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 299 predicate places. [2023-08-31 20:03:08,297 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 865 transitions, 20205 flow [2023-08-31 20:03:08,299 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-31 20:03:08,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:03:08,299 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-31 20:03:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 20:03:08,299 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-31 20:03:08,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:03:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -536452000, now seen corresponding path program 4 times [2023-08-31 20:03:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:03:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844299802] [2023-08-31 20:03:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:03:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:03:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:03:09,729 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-31 20:03:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:03:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844299802] [2023-08-31 20:03:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844299802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:03:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 20:03:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 20:03:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451274471] [2023-08-31 20:03:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:03:09,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:03:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:03:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:03:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-31 20:03:10,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 166 [2023-08-31 20:03:10,281 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-31 20:03:10,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:03:10,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 166 [2023-08-31 20:03:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:03:11,553 INFO L130 PetriNetUnfolder]: 1167/2851 cut-off events. [2023-08-31 20:03:11,553 INFO L131 PetriNetUnfolder]: For 102187/102384 co-relation queries the response was YES. [2023-08-31 20:03:11,577 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-31 20:03:11,589 INFO L137 encePairwiseOnDemand]: 151/166 looper letters, 658 selfloop transitions, 280 changer transitions 22/1061 dead transitions. [2023-08-31 20:03:11,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1061 transitions, 25885 flow [2023-08-31 20:03:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 20:03:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 20:03:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2023-08-31 20:03:11,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49732262382864795 [2023-08-31 20:03:11,591 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2023-08-31 20:03:11,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2023-08-31 20:03:11,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:03:11,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2023-08-31 20:03:11,592 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-31 20:03:11,593 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-31 20:03:11,593 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-31 20:03:11,593 INFO L175 Difference]: Start difference. First operand has 338 places, 865 transitions, 20205 flow. Second operand 9 states and 743 transitions. [2023-08-31 20:03:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1061 transitions, 25885 flow [2023-08-31 20:03:12,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1061 transitions, 25837 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-31 20:03:12,200 INFO L231 Difference]: Finished difference. Result has 351 places, 893 transitions, 21889 flow [2023-08-31 20:03:12,200 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-31 20:03:12,201 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 312 predicate places. [2023-08-31 20:03:12,201 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 893 transitions, 21889 flow [2023-08-31 20:03:12,201 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-31 20:03:12,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:03:12,201 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-31 20:03:12,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 20:03:12,202 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-31 20:03:12,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:03:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash 222619341, now seen corresponding path program 2 times [2023-08-31 20:03:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:03:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251258150] [2023-08-31 20:03:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:03:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:03:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:03:15,271 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-31 20:03:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:03:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251258150] [2023-08-31 20:03:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251258150] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 20:03:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752033698] [2023-08-31 20:03:15,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 20:03:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 20:03:15,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 20:03:15,273 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-31 20:03:15,276 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-31 20:03:15,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 20:03:15,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 20:03:15,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-31 20:03:15,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 20:03:15,406 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-31 20:03:15,455 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-31 20:03:15,455 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-31 20:03:15,552 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-31 20:03:15,608 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-31 20:03:15,677 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-31 20:03:15,750 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-31 20:03:15,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:15,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 20:03:15,849 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-31 20:03:15,862 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-31 20:03:15,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 20:03:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752033698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 20:03:15,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 20:03:15,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2023-08-31 20:03:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078999216] [2023-08-31 20:03:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:03:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 20:03:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:03:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 20:03:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2023-08-31 20:03:16,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 166 [2023-08-31 20:03:16,315 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-31 20:03:16,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:03:16,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 166 [2023-08-31 20:03:16,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:03:18,152 INFO L130 PetriNetUnfolder]: 1358/3227 cut-off events. [2023-08-31 20:03:18,152 INFO L131 PetriNetUnfolder]: For 119392/119553 co-relation queries the response was YES. [2023-08-31 20:03:18,178 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-31 20:03:18,191 INFO L137 encePairwiseOnDemand]: 148/166 looper letters, 896 selfloop transitions, 114 changer transitions 64/1084 dead transitions. [2023-08-31 20:03:18,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1084 transitions, 27744 flow [2023-08-31 20:03:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 20:03:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 20:03:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 788 transitions. [2023-08-31 20:03:18,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746987951807229 [2023-08-31 20:03:18,193 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 788 transitions. [2023-08-31 20:03:18,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 788 transitions. [2023-08-31 20:03:18,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 20:03:18,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 788 transitions. [2023-08-31 20:03:18,194 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-31 20:03:18,195 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-31 20:03:18,196 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-31 20:03:18,196 INFO L175 Difference]: Start difference. First operand has 351 places, 893 transitions, 21889 flow. Second operand 10 states and 788 transitions. [2023-08-31 20:03:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1084 transitions, 27744 flow [2023-08-31 20:03:18,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1084 transitions, 27687 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-31 20:03:18,774 INFO L231 Difference]: Finished difference. Result has 363 places, 931 transitions, 23029 flow [2023-08-31 20:03:18,775 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-31 20:03:18,775 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 324 predicate places. [2023-08-31 20:03:18,775 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 931 transitions, 23029 flow [2023-08-31 20:03:18,775 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-31 20:03:18,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 20:03:18,776 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-31 20:03:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-31 20:03:18,982 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-31 20:03:18,982 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-31 20:03:18,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 20:03:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1476552406, now seen corresponding path program 5 times [2023-08-31 20:03:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 20:03:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315972978] [2023-08-31 20:03:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 20:03:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 20:03:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 20:03:24,195 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-31 20:03:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 20:03:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315972978] [2023-08-31 20:03:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315972978] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 20:03:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091527585] [2023-08-31 20:03:24,196 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 20:03:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 20:03:24,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 20:03:24,197 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-31 20:03:24,198 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-31 20:03:24,338 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-31 20:03:24,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 20:03:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-31 20:03:24,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 20:03:24,585 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-31 20:03:24,648 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-31 20:03:24,723 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-31 20:03:24,806 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-31 20:03:24,892 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-31 20:03:24,892 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-31 20:03:25,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,005 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-31 20:03:25,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,043 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-31 20:03:25,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,153 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-31 20:03:25,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,283 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-31 20:03:25,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,430 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-31 20:03:25,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 20:03:25,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 20:03:25,655 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-31 20:03:35,812 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-31 20:03:35,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 20:04:26,130 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-31 20:04:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091527585] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 20:04:26,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 20:04:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19, 19] total 48 [2023-08-31 20:04:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816288405] [2023-08-31 20:04:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 20:04:26,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 20:04:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 20:04:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 20:04:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2116, Unknown=10, NotChecked=0, Total=2352 [2023-08-31 20:04:28,137 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-31 20:04:30,164 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-31 20:04:32,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-31 20:04:34,204 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-31 20:04:36,215 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-31 20:04:38,224 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-31 20:04:40,235 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-31 20:04:42,247 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-31 20:04:44,257 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-31 20:04:46,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-31 20:04:48,295 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-31 20:04:50,328 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-31 20:04:52,351 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-31 20:04:54,361 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-31 20:04:56,372 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-31 20:04:58,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-31 20:05:00,782 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-31 20:05:02,811 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-31 20:05:04,844 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-31 20:05:06,883 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-31 20:05:08,917 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-31 20:05:11,090 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-31 20:05:13,121 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-31 20:05:15,134 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-31 20:05:17,145 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-31 20:05:18,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:05:20,350 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-31 20:05:22,359 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-31 20:05:24,389 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-31 20:05:26,427 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-31 20:05:28,481 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-31 20:05:30,493 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-31 20:05:32,504 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-31 20:05:34,515 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-31 20:05:36,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-31 20:05:38,556 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-31 20:05:40,597 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-31 20:05:42,608 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-31 20:05:42,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 166 [2023-08-31 20:05:42,608 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-31 20:05:42,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 20:05:42,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 166 [2023-08-31 20:05:42,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 20:05:46,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:05:48,178 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-31 20:05:49,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:05:55,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:05:59,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:06:01,579 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-31 20:06:15,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:06:17,262 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-31 20:06:19,317 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-31 20:06:21,363 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-31 20:06:23,374 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-31 20:06:25,834 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-31 20:06:27,883 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-31 20:06:29,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:06:34,155 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 ((.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.cse21 (+ |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))))) (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 ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse18 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse18 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse19 (let ((.cse20 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse18 |c_~#a~0.offset| 1) 0) (+ .cse18 2 |c_~#a~0.offset|) 0)))) (store .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse19 |c_~#a~0.base| (store (store (select .cse19 |c_~#a~0.base|) (+ .cse18 3 |c_~#a~0.offset|) 0) (+ .cse18 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse21)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse22 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse22 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse22 |c_~#a~0.offset| 1) 0) (+ .cse22 2 |c_~#a~0.offset|) 0)))) (store .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse23 |c_~#a~0.base| (store (store (select .cse23 |c_~#a~0.base|) (+ .cse22 3 |c_~#a~0.offset|) 0) (+ .cse22 |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 ((.cse25 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse25 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse25 |c_~#a~0.offset| 1) 0) (+ .cse25 2 |c_~#a~0.offset|) 0)))) (store .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse26 |c_~#a~0.base| (store (store (select .cse26 |c_~#a~0.base|) (+ .cse25 3 |c_~#a~0.offset|) 0) (+ .cse25 |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 ((.cse29 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse28 (let ((.cse30 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse29 |c_~#a~0.offset| 1) 0) (+ .cse29 2 |c_~#a~0.offset|) 0)))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse28 |c_~#a~0.base| (store (store (select .cse28 |c_~#a~0.base|) (+ .cse29 3 |c_~#a~0.offset|) 0) (+ .cse29 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse21) 0)) (not (= (select .cse0 (+ .cse29 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-31 20:06:36,190 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-31 20:06:38,200 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-31 20:06:40,517 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-31 20:06:44,087 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-31 20:06:46,104 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-31 20:06:48,942 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-31 20:06:50,961 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-31 20:06:53,007 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-31 20:06:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:06:58,727 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-31 20:07:00,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:02,310 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-31 20:07:04,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-31 20:07:06,376 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-31 20:07:08,394 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-31 20:07:10,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-31 20:07:11,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:13,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:15,612 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-31 20:07:18,418 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-31 20:07:20,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-31 20:07:22,557 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-31 20:07:24,565 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-31 20:07:26,703 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-31 20:07:31,308 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-31 20:07:33,367 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-31 20:07:35,385 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-31 20:07:36,688 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-31 20:07:38,789 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-31 20:07:39,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:40,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:43,927 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-31 20:07:46,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:47,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:49,450 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-31 20:07:51,865 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-31 20:07:53,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:55,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:07:58,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:08:00,024 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-31 20:08:02,075 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-31 20:08:13,670 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-31 20:08:15,729 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-31 20:08:17,745 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-31 20:08:18,943 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-31 20:08:20,997 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-31 20:08:27,481 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-31 20:08:29,489 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-31 20:08:31,533 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-31 20:08:34,574 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-31 20:08:36,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:08:39,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:08:41,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:08:43,332 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse14 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse20 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse14 .cse20 0))) (.cse18 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store .cse14 .cse30 0) .cse20 0)))) (let ((.cse10 (select |c_#race| |c_~#a~0.base|)) (.cse19 (select .cse18 |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.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)) (= 0 (select (select (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#a~0.base| (store (store .cse19 (+ .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|) .cse20)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse21 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse21 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse21 |c_~#a~0.offset| 1) 0) (+ .cse21 2 |c_~#a~0.offset|) 0)))) (store .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse22 |c_~#a~0.base| (store (store (select .cse22 |c_~#a~0.base|) (+ .cse21 3 |c_~#a~0.offset|) 0) (+ .cse21 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse20) 0))))) (= 0 (select .cse14 |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse24 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse24 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse18 |c_~#a~0.base| (store (store .cse19 (+ .cse24 |c_~#a~0.offset| 1) 0) (+ .cse24 2 |c_~#a~0.offset|) 0)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse25 |c_~#a~0.base| (store (store (select .cse25 |c_~#a~0.base|) (+ .cse24 3 |c_~#a~0.offset|) 0) (+ .cse24 |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 ((.cse27 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse27 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse28 (let ((.cse29 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse27 |c_~#a~0.offset| 1) 0) (+ .cse27 2 |c_~#a~0.offset|) 0)))) (store .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse28 |c_~#a~0.base| (store (store (select .cse28 |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|) .cse30)))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse31 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse31 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store |c_#race| |c_~#a~0.base| (store (store .cse10 (+ .cse31 |c_~#a~0.offset| 1) 0) (+ .cse31 2 |c_~#a~0.offset|) 0)))) (store .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse32 |c_~#a~0.base| (store (store (select .cse32 |c_~#a~0.base|) (+ .cse31 3 |c_~#a~0.offset|) 0) (+ .cse31 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse20) 0))))) (= (select .cse14 .cse20) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse34 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse34 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse35 (let ((.cse36 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse34 |c_~#a~0.offset| 1) 0) (+ .cse34 2 |c_~#a~0.offset|) 0)))) (store .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse35 |c_~#a~0.base| (store (store (select .cse35 |c_~#a~0.base|) (+ .cse34 3 |c_~#a~0.offset|) 0) (+ .cse34 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (= (select .cse14 .cse30) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse38 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse37 (let ((.cse39 (store .cse18 |c_~#a~0.base| (store (store .cse19 (+ .cse38 |c_~#a~0.offset| 1) 0) (+ .cse38 2 |c_~#a~0.offset|) 0)))) (store .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse37 |c_~#a~0.base| (store (store (select .cse37 |c_~#a~0.base|) (+ .cse38 3 |c_~#a~0.offset|) 0) (+ .cse38 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse30) 0)) (not (= (select .cse0 (+ .cse38 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse41 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse40 (let ((.cse42 (store .cse18 |c_~#a~0.base| (store (store .cse19 (+ .cse41 |c_~#a~0.offset| 1) 0) (+ .cse41 2 |c_~#a~0.offset|) 0)))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse40 |c_~#a~0.base| (store (store (select .cse40 |c_~#a~0.base|) (+ .cse41 3 |c_~#a~0.offset|) 0) (+ .cse41 |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 (+ .cse41 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse44 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse43 (let ((.cse45 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse44 |c_~#a~0.offset| 1) 0) (+ .cse44 2 |c_~#a~0.offset|) 0)))) (store .cse45 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse45 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse43 |c_~#a~0.base| (store (store (select .cse43 |c_~#a~0.base|) (+ .cse44 3 |c_~#a~0.offset|) 0) (+ .cse44 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse30) 0)) (not (= (select .cse0 (+ .cse44 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-31 20:08:45,338 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-31 20:08:47,390 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-31 20:08:49,410 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-31 20:08:51,456 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-31 20:08:53,475 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-31 20:08:55,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:08:59,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-31 20:09:03,445 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-31 20:09:05,454 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-31 20:09:07,499 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-31 20:09:21,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:09:23,051 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-31 20:09:25,123 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-31 20:09:27,911 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-31 20:09:30,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:09:38,407 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-31 20:09:40,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:09:43,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:09:45,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-31 20:09:47,659 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-31 20:09:49,699 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-31 20:09:52,562 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-31 20:09:54,571 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-31 20:09:56,631 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-31 20:09:58,640 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-31 20:10:00,688 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-31 20:10:02,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:05,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:07,883 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-31 20:10:09,892 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-31 20:10:11,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-31 20:10:13,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:15,551 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-31 20:10:28,079 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-31 20:10:32,108 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-31 20:10:33,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:34,240 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-31 20:10:36,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-31 20:10:39,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:41,272 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-31 20:10:43,315 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-31 20:10:48,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:10:52,483 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-31 20:10:54,521 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-31 20:10:56,529 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-31 20:10:58,586 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-31 20:11:00,599 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-31 20:11:02,610 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-31 20:11:04,694 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-31 20:11:06,711 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-31 20:11:09,674 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-31 20:11:12,818 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-31 20:11:17,354 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-31 20:11:19,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:20,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:23,723 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-31 20:11:31,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:33,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:35,502 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-31 20:11:38,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:42,809 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-31 20:11:44,819 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-31 20:11:46,897 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-31 20:11:48,915 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-31 20:11:50,924 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-31 20:11:52,976 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-31 20:11:54,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-31 20:11:56,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:11:58,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:00,637 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse23 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse7 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse13 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse7 .cse13 0))) (.cse11 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store .cse7 .cse23 0) .cse13 0)))) (let ((.cse12 (select .cse11 |c_~#a~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse6 (select .cse5 |c_~#a~0.base|)) (.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))))) (= (select .cse7 .cse4) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse8 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse8 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= 0 (select (select (let ((.cse9 (let ((.cse10 (store .cse11 |c_~#a~0.base| (store (store .cse12 (+ .cse8 |c_~#a~0.offset| 1) 0) (+ .cse8 2 |c_~#a~0.offset|) 0)))) (store .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse9 |c_~#a~0.base| (store (store (select .cse9 |c_~#a~0.base|) (+ .cse8 3 |c_~#a~0.offset|) 0) (+ .cse8 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13)))))) (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|) .cse13) 0))))) (= 0 (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse17 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse17 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store .cse11 |c_~#a~0.base| (store (store .cse12 (+ .cse17 |c_~#a~0.offset| 1) 0) (+ .cse17 2 |c_~#a~0.offset|) 0)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse18 |c_~#a~0.base| (store (store (select .cse18 |c_~#a~0.base|) (+ .cse17 3 |c_~#a~0.offset|) 0) (+ .cse17 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0))))) (= (select .cse7 .cse13) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse20 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse20 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse20 |c_~#a~0.offset| 1) 0) (+ .cse20 2 |c_~#a~0.offset|) 0)))) (store .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse21 |c_~#a~0.base| (store (store (select .cse21 |c_~#a~0.base|) (+ .cse20 3 |c_~#a~0.offset|) 0) (+ .cse20 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))) (= (select .cse7 .cse23) 0) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse25 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse24 (let ((.cse26 (store .cse11 |c_~#a~0.base| (store (store .cse12 (+ .cse25 |c_~#a~0.offset| 1) 0) (+ .cse25 2 |c_~#a~0.offset|) 0)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse24 |c_~#a~0.base| (store (store (select .cse24 |c_~#a~0.base|) (+ .cse25 3 |c_~#a~0.offset|) 0) (+ .cse25 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse23) 0)) (not (= (select .cse0 (+ .cse25 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse28 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse27 (let ((.cse29 (store .cse11 |c_~#a~0.base| (store (store .cse12 (+ .cse28 |c_~#a~0.offset| 1) 0) (+ .cse28 2 |c_~#a~0.offset|) 0)))) (store .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse27 |c_~#a~0.base| (store (store (select .cse27 |c_~#a~0.base|) (+ .cse28 3 |c_~#a~0.offset|) 0) (+ .cse28 |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 (+ .cse28 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse31 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_1544 Int)) (= (select (select (let ((.cse30 (let ((.cse32 (store .cse5 |c_~#a~0.base| (store (store .cse6 (+ .cse31 |c_~#a~0.offset| 1) 0) (+ .cse31 2 |c_~#a~0.offset|) 0)))) (store .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))))) (store .cse30 |c_~#a~0.base| (store (store (select .cse30 |c_~#a~0.base|) (+ .cse31 3 |c_~#a~0.offset|) 0) (+ .cse31 |c_~#a~0.offset|) v_ArrVal_1544))) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse23) 0)) (not (= (select .cse0 (+ .cse31 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-31 20:12:02,649 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-31 20:12:04,657 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-31 20:12:06,719 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-31 20:12:11,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:13,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:16,146 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-31 20:12:17,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:19,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:20,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:23,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:26,983 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-31 20:12:29,026 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-31 20:12:34,906 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-31 20:12:36,948 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-31 20:12:38,961 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-31 20:12:40,970 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-31 20:12:42,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-31 20:12:45,003 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-31 20:12:47,085 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-31 20:12:49,104 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-31 20:12:51,164 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-31 20:12:52,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:12:58,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:13:00,090 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-31 20:13:01,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:13:03,705 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-31 20:13:05,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-31 20:13:08,918 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-31 20:13:10,927 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-31 20:13:13,046 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-31 20:13:14,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:13:17,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:13:19,643 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-31 20:13:21,690 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-31 20:13:22,992 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-31 20:13:25,001 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-31 20:13:27,061 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-31 20:13:29,877 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-31 20:13:33,639 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-31 20:13:35,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 20:13:37,459 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-31 20:13:39,533 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] Killed by 15