./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/pthread/queue_ok_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --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-09-01 08:50:30,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 08:50:30,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 08:50:30,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 08:50:30,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 08:50:30,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 08:50:30,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 08:50:30,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 08:50:30,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 08:50:30,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 08:50:30,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 08:50:30,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 08:50:30,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 08:50:30,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 08:50:30,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 08:50:30,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 08:50:30,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 08:50:30,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 08:50:30,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 08:50:30,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 08:50:30,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 08:50:30,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 08:50:30,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 08:50:30,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 08:50:30,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 08:50:30,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 08:50:30,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 08:50:30,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 08:50:30,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 08:50:30,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 08:50:30,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 08:50:30,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 08:50:30,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 08:50:30,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 08:50:30,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 08:50:30,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 08:50:30,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 08:50:30,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 08:50:30,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 08:50:30,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 08:50:30,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 08:50:30,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 08:50:30,987 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 08:50:30,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 08:50:30,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 08:50:30,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 08:50:30,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 08:50:30,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 08:50:30,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 08:50:30,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 08:50:30,991 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 08:50:30,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 08:50:30,992 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 08:50:30,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 08:50:30,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 08:50:30,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 08:50:30,994 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 08:50:30,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 08:50:30,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 08:50:30,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 08:50:30,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 08:50:30,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 08:50:30,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 08:50:30,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 08:50:30,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 08:50:30,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 08:50:30,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 08:50:30,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 08:50:30,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 08:50:30,996 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 08:50:30,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 08:50:30,997 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 08:50:30,997 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d 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-09-01 08:50:31,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 08:50:31,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 08:50:31,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 08:50:31,304 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 08:50:31,304 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 08:50:31,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-09-01 08:50:32,381 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 08:50:32,709 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 08:50:32,710 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-09-01 08:50:32,734 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaa8f85a/33eca45f3ea04b2fa8f6423146d2558a/FLAGd589384d7 [2023-09-01 08:50:32,755 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaa8f85a/33eca45f3ea04b2fa8f6423146d2558a [2023-09-01 08:50:32,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 08:50:32,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 08:50:32,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 08:50:32,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 08:50:32,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 08:50:32,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 08:50:32" (1/1) ... [2023-09-01 08:50:32,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d61008d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:32, skipping insertion in model container [2023-09-01 08:50:32,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 08:50:32" (1/1) ... [2023-09-01 08:50:32,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 08:50:32,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 08:50:33,241 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-09-01 08:50:33,246 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-09-01 08:50:33,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 08:50:33,261 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 08:50:33,293 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-09-01 08:50:33,295 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-09-01 08:50:33,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 08:50:33,399 INFO L208 MainTranslator]: Completed translation [2023-09-01 08:50:33,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33 WrapperNode [2023-09-01 08:50:33,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 08:50:33,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 08:50:33,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 08:50:33,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 08:50:33,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,449 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-01 08:50:33,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 08:50:33,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 08:50:33,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 08:50:33,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 08:50:33,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 08:50:33,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 08:50:33,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 08:50:33,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 08:50:33,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (1/1) ... [2023-09-01 08:50:33,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 08:50:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:33,546 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-09-01 08:50:33,552 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-09-01 08:50:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 08:50:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 08:50:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 08:50:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 08:50:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 08:50:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 08:50:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 08:50:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 08:50:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 08:50:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 08:50:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 08:50:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 08:50:33,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 08:50:33,580 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 08:50:33,719 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 08:50:33,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 08:50:34,071 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 08:50:34,079 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 08:50:34,080 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 08:50:34,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 08:50:34 BoogieIcfgContainer [2023-09-01 08:50:34,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 08:50:34,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 08:50:34,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 08:50:34,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 08:50:34,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 08:50:32" (1/3) ... [2023-09-01 08:50:34,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223593d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 08:50:34, skipping insertion in model container [2023-09-01 08:50:34,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 08:50:33" (2/3) ... [2023-09-01 08:50:34,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223593d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 08:50:34, skipping insertion in model container [2023-09-01 08:50:34,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 08:50:34" (3/3) ... [2023-09-01 08:50:34,089 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-09-01 08:50:34,095 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 08:50:34,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 08:50:34,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 08:50:34,102 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 08:50:34,186 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 08:50:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-09-01 08:50:34,294 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-09-01 08:50:34,295 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 08:50:34,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 13/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 359 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-09-01 08:50:34,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-09-01 08:50:34,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-09-01 08:50:34,319 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 08:50:34,330 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-09-01 08:50:34,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-09-01 08:50:34,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-09-01 08:50:34,373 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-09-01 08:50:34,373 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 08:50:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 205 events. 13/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-09-01 08:50:34,380 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-09-01 08:50:41,159 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-09-01 08:50:41,160 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-09-01 08:50:41,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 08:50:41,177 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;@75978dc1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 08:50:41,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 08:50:41,178 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 08:50:41,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 08:50:41,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:41,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 08:50:41,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:41,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-09-01 08:50:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240975683] [2023-09-01 08:50:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240975683] [2023-09-01 08:50:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240975683] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:50:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:50:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 08:50:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076986823] [2023-09-01 08:50:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:50:41,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 08:50:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 08:50:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 08:50:41,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-09-01 08:50:41,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:41,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-09-01 08:50:41,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:41,555 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-09-01 08:50:41,555 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-09-01 08:50:41,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1341 events. 829/1341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5736 event pairs, 621 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 2519. Up to 1297 conditions per place. [2023-09-01 08:50:41,566 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-09-01 08:50:41,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-09-01 08:50:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 08:50:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 08:50:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-09-01 08:50:41,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-09-01 08:50:41,587 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-09-01 08:50:41,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-09-01 08:50:41,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:41,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-09-01 08:50:41,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.0) internal successors, (450), 2 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,603 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,604 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-09-01 08:50:41,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-09-01 08:50:41,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 08:50:41,610 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-09-01 08:50:41,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-09-01 08:50:41,614 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-09-01 08:50:41,615 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-09-01 08:50:41,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:41,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:41,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 08:50:41,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:41,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-09-01 08:50:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793203565] [2023-09-01 08:50:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793203565] [2023-09-01 08:50:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793203565] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:50:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:50:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 08:50:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476415345] [2023-09-01 08:50:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:50:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:50:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:50:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:50:41,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:50:41,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:41,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:50:41,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:41,987 INFO L130 PetriNetUnfolder]: 197/403 cut-off events. [2023-09-01 08:50:41,987 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 08:50:41,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 403 events. 197/403 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1584 event pairs, 125 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 808. Up to 193 conditions per place. [2023-09-01 08:50:41,989 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 5/52 dead transitions. [2023-09-01 08:50:41,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 203 flow [2023-09-01 08:50:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:50:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:50:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2023-09-01 08:50:41,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364842454394693 [2023-09-01 08:50:41,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2023-09-01 08:50:41,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2023-09-01 08:50:41,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:41,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2023-09-01 08:50:41,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:41,998 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 647 transitions. [2023-09-01 08:50:41,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 203 flow [2023-09-01 08:50:41,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 08:50:42,000 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 98 flow [2023-09-01 08:50:42,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-09-01 08:50:42,001 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-09-01 08:50:42,001 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 98 flow [2023-09-01 08:50:42,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:42,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:42,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 08:50:42,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:42,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-09-01 08:50:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403778475] [2023-09-01 08:50:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403778475] [2023-09-01 08:50:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403778475] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:50:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:50:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 08:50:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286241759] [2023-09-01 08:50:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:50:42,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:50:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:50:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:50:42,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 402 [2023-09-01 08:50:42,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:42,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 402 [2023-09-01 08:50:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:42,191 INFO L130 PetriNetUnfolder]: 245/498 cut-off events. [2023-09-01 08:50:42,192 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 08:50:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 498 events. 245/498 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1823 event pairs, 155 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 1028. Up to 357 conditions per place. [2023-09-01 08:50:42,194 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-09-01 08:50:42,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 230 flow [2023-09-01 08:50:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:50:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:50:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2023-09-01 08:50:42,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543117744610282 [2023-09-01 08:50:42,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2023-09-01 08:50:42,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2023-09-01 08:50:42,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:42,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2023-09-01 08:50:42,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,203 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 98 flow. Second operand 3 states and 655 transitions. [2023-09-01 08:50:42,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 230 flow [2023-09-01 08:50:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 08:50:42,205 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 113 flow [2023-09-01 08:50:42,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-09-01 08:50:42,206 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-09-01 08:50:42,206 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 113 flow [2023-09-01 08:50:42,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:42,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:42,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 08:50:42,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:42,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-09-01 08:50:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635448801] [2023-09-01 08:50:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:42,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635448801] [2023-09-01 08:50:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635448801] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 08:50:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 08:50:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 08:50:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905493185] [2023-09-01 08:50:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 08:50:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 08:50:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 08:50:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 08:50:42,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-09-01 08:50:42,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:42,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-09-01 08:50:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:42,499 INFO L130 PetriNetUnfolder]: 230/513 cut-off events. [2023-09-01 08:50:42,499 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-09-01 08:50:42,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 513 events. 230/513 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2000 event pairs, 29 based on Foata normal form. 42/525 useless extension candidates. Maximal degree in co-relation 1099. Up to 407 conditions per place. [2023-09-01 08:50:42,502 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 43 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-09-01 08:50:42,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 222 flow [2023-09-01 08:50:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 08:50:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 08:50:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-09-01 08:50:42,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339966832504146 [2023-09-01 08:50:42,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-09-01 08:50:42,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-09-01 08:50:42,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:42,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-09-01 08:50:42,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 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-09-01 08:50:42,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,509 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 113 flow. Second operand 3 states and 644 transitions. [2023-09-01 08:50:42,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 222 flow [2023-09-01 08:50:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 08:50:42,511 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 114 flow [2023-09-01 08:50:42,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-09-01 08:50:42,512 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-09-01 08:50:42,512 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 114 flow [2023-09-01 08:50:42,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:42,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 08:50:42,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:42,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-09-01 08:50:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782186541] [2023-09-01 08:50:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782186541] [2023-09-01 08:50:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782186541] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:50:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226214271] [2023-09-01 08:50:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:42,585 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-09-01 08:50:42,624 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-09-01 08:50:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:42,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 08:50:42,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:50:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:42,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:50:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226214271] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:50:42,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:50:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 08:50:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644727206] [2023-09-01 08:50:42,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:50:42,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 08:50:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 08:50:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 08:50:42,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:50:42,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 205.57142857142858) internal successors, (1439), 7 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:42,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:42,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:50:42,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:43,039 INFO L130 PetriNetUnfolder]: 246/536 cut-off events. [2023-09-01 08:50:43,039 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-09-01 08:50:43,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 536 events. 246/536 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1552 event pairs, 100 based on Foata normal form. 12/512 useless extension candidates. Maximal degree in co-relation 1199. Up to 238 conditions per place. [2023-09-01 08:50:43,042 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2023-09-01 08:50:43,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 372 flow [2023-09-01 08:50:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 08:50:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 08:50:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2023-09-01 08:50:43,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319237147595357 [2023-09-01 08:50:43,046 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1283 transitions. [2023-09-01 08:50:43,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1283 transitions. [2023-09-01 08:50:43,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:43,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1283 transitions. [2023-09-01 08:50:43,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.83333333333334) internal successors, (1283), 6 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:43,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:43,054 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:43,054 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 114 flow. Second operand 6 states and 1283 transitions. [2023-09-01 08:50:43,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 372 flow [2023-09-01 08:50:43,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 08:50:43,057 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 172 flow [2023-09-01 08:50:43,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-09-01 08:50:43,057 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-09-01 08:50:43,058 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 172 flow [2023-09-01 08:50:43,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 205.57142857142858) internal successors, (1439), 7 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:43,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:43,059 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:43,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 08:50:43,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:43,265 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:43,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-09-01 08:50:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653015623] [2023-09-01 08:50:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:43,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653015623] [2023-09-01 08:50:43,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653015623] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:50:43,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253881032] [2023-09-01 08:50:43,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 08:50:43,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:43,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:43,460 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-09-01 08:50:43,462 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-09-01 08:50:43,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 08:50:43,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:50:43,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 08:50:43,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:50:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:43,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:50:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253881032] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:50:43,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:50:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-09-01 08:50:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984999721] [2023-09-01 08:50:43,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:50:43,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 08:50:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 08:50:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-09-01 08:50:43,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:50:43,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 205.84615384615384) internal successors, (2676), 13 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:43,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:43,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:50:43,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:44,173 INFO L130 PetriNetUnfolder]: 423/937 cut-off events. [2023-09-01 08:50:44,174 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-09-01 08:50:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 937 events. 423/937 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2594 event pairs, 91 based on Foata normal form. 24/903 useless extension candidates. Maximal degree in co-relation 2360. Up to 217 conditions per place. [2023-09-01 08:50:44,179 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2023-09-01 08:50:44,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 838 flow [2023-09-01 08:50:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 08:50:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 08:50:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2564 transitions. [2023-09-01 08:50:44,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315091210613598 [2023-09-01 08:50:44,185 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2564 transitions. [2023-09-01 08:50:44,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2564 transitions. [2023-09-01 08:50:44,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:44,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2564 transitions. [2023-09-01 08:50:44,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.66666666666666) internal successors, (2564), 12 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:44,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:44,199 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:44,199 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 172 flow. Second operand 12 states and 2564 transitions. [2023-09-01 08:50:44,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 838 flow [2023-09-01 08:50:44,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 799 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-09-01 08:50:44,204 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 322 flow [2023-09-01 08:50:44,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-09-01 08:50:44,205 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-09-01 08:50:44,205 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 322 flow [2023-09-01 08:50:44,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 205.84615384615384) internal successors, (2676), 13 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:44,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:44,207 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:44,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 08:50:44,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-09-01 08:50:44,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:44,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-09-01 08:50:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839742538] [2023-09-01 08:50:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839742538] [2023-09-01 08:50:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839742538] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:50:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218017701] [2023-09-01 08:50:44,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 08:50:44,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:44,865 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-09-01 08:50:44,891 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-09-01 08:50:45,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-01 08:50:45,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:50:45,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 47 conjunts are in the unsatisfiable core [2023-09-01 08:50:45,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:50:45,787 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-09-01 08:50:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:50:45,814 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 14 treesize of output 16 [2023-09-01 08:50:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:50:45,875 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-09-01 08:50:45,919 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 19 treesize of output 18 [2023-09-01 08:50:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-09-01 08:50:45,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:50:46,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:50:46,085 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2023-09-01 08:50:46,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:50:46,100 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 75 treesize of output 77 [2023-09-01 08:50:46,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-09-01 08:50:46,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-09-01 08:50:46,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:50:46,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 46 [2023-09-01 08:50:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-09-01 08:50:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218017701] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:50:46,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:50:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2023-09-01 08:50:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941312922] [2023-09-01 08:50:46,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:50:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-01 08:50:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-01 08:50:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=473, Unknown=4, NotChecked=0, Total=600 [2023-09-01 08:50:47,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 402 [2023-09-01 08:50:47,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 322 flow. Second operand has 25 states, 25 states have (on average 156.6) internal successors, (3915), 25 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:47,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:47,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 402 [2023-09-01 08:50:47,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:49,268 INFO L130 PetriNetUnfolder]: 821/1809 cut-off events. [2023-09-01 08:50:49,268 INFO L131 PetriNetUnfolder]: For 1316/1316 co-relation queries the response was YES. [2023-09-01 08:50:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 1809 events. 821/1809 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6526 event pairs, 57 based on Foata normal form. 8/1746 useless extension candidates. Maximal degree in co-relation 4853. Up to 285 conditions per place. [2023-09-01 08:50:49,278 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 267 selfloop transitions, 110 changer transitions 1/381 dead transitions. [2023-09-01 08:50:49,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 381 transitions, 2042 flow [2023-09-01 08:50:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-09-01 08:50:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-09-01 08:50:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6885 transitions. [2023-09-01 08:50:49,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3982992016660882 [2023-09-01 08:50:49,300 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6885 transitions. [2023-09-01 08:50:49,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6885 transitions. [2023-09-01 08:50:49,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:49,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6885 transitions. [2023-09-01 08:50:49,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 160.11627906976744) internal successors, (6885), 43 states have internal predecessors, (6885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:49,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 402.0) internal successors, (17688), 44 states have internal predecessors, (17688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:49,357 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 402.0) internal successors, (17688), 44 states have internal predecessors, (17688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:49,357 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 322 flow. Second operand 43 states and 6885 transitions. [2023-09-01 08:50:49,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 381 transitions, 2042 flow [2023-09-01 08:50:49,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 381 transitions, 2027 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 08:50:49,368 INFO L231 Difference]: Finished difference. Result has 135 places, 164 transitions, 1174 flow [2023-09-01 08:50:49,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1174, PETRI_PLACES=135, PETRI_TRANSITIONS=164} [2023-09-01 08:50:49,369 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 88 predicate places. [2023-09-01 08:50:49,369 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 164 transitions, 1174 flow [2023-09-01 08:50:49,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 156.6) internal successors, (3915), 25 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:49,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:49,371 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:49,380 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-09-01 08:50:49,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:49,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:49,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -161773555, now seen corresponding path program 1 times [2023-09-01 08:50:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845125782] [2023-09-01 08:50:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:50,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845125782] [2023-09-01 08:50:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845125782] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:50:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180992841] [2023-09-01 08:50:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:50,045 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-09-01 08:50:50,068 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-09-01 08:50:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:50,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 08:50:50,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:50:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:50,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:50:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180992841] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:50:50,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:50:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-09-01 08:50:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079517187] [2023-09-01 08:50:50,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:50:50,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-09-01 08:50:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-09-01 08:50:50,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-09-01 08:50:50,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:50:50,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 164 transitions, 1174 flow. Second operand has 27 states, 27 states have (on average 206.25925925925927) internal successors, (5569), 27 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:50,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:50,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:50:50,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:51,788 INFO L130 PetriNetUnfolder]: 1371/3215 cut-off events. [2023-09-01 08:50:51,788 INFO L131 PetriNetUnfolder]: For 28289/28289 co-relation queries the response was YES. [2023-09-01 08:50:51,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14009 conditions, 3215 events. 1371/3215 cut-off events. For 28289/28289 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 11621 event pairs, 136 based on Foata normal form. 104/3295 useless extension candidates. Maximal degree in co-relation 13966. Up to 452 conditions per place. [2023-09-01 08:50:51,819 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 413 selfloop transitions, 75 changer transitions 0/492 dead transitions. [2023-09-01 08:50:51,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 492 transitions, 5505 flow [2023-09-01 08:50:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-01 08:50:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-09-01 08:50:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5553 transitions. [2023-09-01 08:50:51,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312858783008036 [2023-09-01 08:50:51,835 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5553 transitions. [2023-09-01 08:50:51,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5553 transitions. [2023-09-01 08:50:51,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:51,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5553 transitions. [2023-09-01 08:50:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 213.57692307692307) internal successors, (5553), 26 states have internal predecessors, (5553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:51,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 402.0) internal successors, (10854), 27 states have internal predecessors, (10854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:51,867 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 402.0) internal successors, (10854), 27 states have internal predecessors, (10854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:51,867 INFO L175 Difference]: Start difference. First operand has 135 places, 164 transitions, 1174 flow. Second operand 26 states and 5553 transitions. [2023-09-01 08:50:51,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 492 transitions, 5505 flow [2023-09-01 08:50:51,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 492 transitions, 5318 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-09-01 08:50:51,924 INFO L231 Difference]: Finished difference. Result has 163 places, 202 transitions, 1744 flow [2023-09-01 08:50:51,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1744, PETRI_PLACES=163, PETRI_TRANSITIONS=202} [2023-09-01 08:50:51,924 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 116 predicate places. [2023-09-01 08:50:51,925 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 1744 flow [2023-09-01 08:50:51,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 206.25925925925927) internal successors, (5569), 27 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:51,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:51,926 INFO L208 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:51,937 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-09-01 08:50:52,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:52,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:52,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash -346057744, now seen corresponding path program 2 times [2023-09-01 08:50:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529949969] [2023-09-01 08:50:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:50:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:50:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529949969] [2023-09-01 08:50:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529949969] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:50:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63334931] [2023-09-01 08:50:53,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 08:50:53,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:53,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:50:53,456 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-09-01 08:50:53,458 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-09-01 08:50:53,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 08:50:53,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:50:53,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 26 conjunts are in the unsatisfiable core [2023-09-01 08:50:53,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:50:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:54,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:50:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:50:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63334931] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:50:54,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:50:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2023-09-01 08:50:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257356311] [2023-09-01 08:50:55,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:50:55,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-09-01 08:50:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:50:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-09-01 08:50:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2023-09-01 08:50:55,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:50:55,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 202 transitions, 1744 flow. Second operand has 53 states, 53 states have (on average 206.41509433962264) internal successors, (10940), 53 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:55,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:50:55,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:50:55,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:50:57,881 INFO L130 PetriNetUnfolder]: 2697/6387 cut-off events. [2023-09-01 08:50:57,881 INFO L131 PetriNetUnfolder]: For 100006/100006 co-relation queries the response was YES. [2023-09-01 08:50:57,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29612 conditions, 6387 events. 2697/6387 cut-off events. For 100006/100006 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 23275 event pairs, 136 based on Foata normal form. 208/6571 useless extension candidates. Maximal degree in co-relation 29556. Up to 1128 conditions per place. [2023-09-01 08:50:57,950 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 829 selfloop transitions, 153 changer transitions 0/986 dead transitions. [2023-09-01 08:50:57,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 986 transitions, 11797 flow [2023-09-01 08:50:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-09-01 08:50:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-09-01 08:50:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 11104 transitions. [2023-09-01 08:50:57,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311902028319939 [2023-09-01 08:50:57,969 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 11104 transitions. [2023-09-01 08:50:57,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 11104 transitions. [2023-09-01 08:50:57,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:50:57,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 11104 transitions. [2023-09-01 08:50:57,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 213.53846153846155) internal successors, (11104), 52 states have internal predecessors, (11104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:58,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 402.0) internal successors, (21306), 53 states have internal predecessors, (21306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:58,026 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 402.0) internal successors, (21306), 53 states have internal predecessors, (21306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:58,027 INFO L175 Difference]: Start difference. First operand has 163 places, 202 transitions, 1744 flow. Second operand 52 states and 11104 transitions. [2023-09-01 08:50:58,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 986 transitions, 11797 flow [2023-09-01 08:50:58,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 986 transitions, 11734 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-09-01 08:50:58,236 INFO L231 Difference]: Finished difference. Result has 230 places, 282 transitions, 3412 flow [2023-09-01 08:50:58,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=3412, PETRI_PLACES=230, PETRI_TRANSITIONS=282} [2023-09-01 08:50:58,237 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 183 predicate places. [2023-09-01 08:50:58,237 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 282 transitions, 3412 flow [2023-09-01 08:50:58,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 206.41509433962264) internal successors, (10940), 53 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:50:58,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:50:58,240 INFO L208 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:50:58,251 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-09-01 08:50:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:50:58,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:50:58,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:50:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 890330880, now seen corresponding path program 3 times [2023-09-01 08:50:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:50:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737043125] [2023-09-01 08:50:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:50:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:50:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:51:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 0 proven. 7675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:51:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:51:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737043125] [2023-09-01 08:51:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737043125] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:51:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129954329] [2023-09-01 08:51:02,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 08:51:02,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:51:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:51:02,355 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-09-01 08:51:02,357 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-09-01 08:51:03,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-09-01 08:51:03,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:51:03,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 59 conjunts are in the unsatisfiable core [2023-09-01 08:51:03,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:51:04,937 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-09-01 08:51:04,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:51:04,984 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 16 treesize of output 18 [2023-09-01 08:51:05,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:51:05,050 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-09-01 08:51:05,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-09-01 08:51:05,119 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 23 treesize of output 22 [2023-09-01 08:51:05,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-09-01 08:51:05,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:51:05,251 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 16 treesize of output 18 [2023-09-01 08:51:05,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:51:05,385 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-09-01 08:51:05,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2023-09-01 08:51:05,458 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 23 treesize of output 22 [2023-09-01 08:51:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 644 proven. 245 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2023-09-01 08:51:05,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:51:05,614 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2175)) .cse1))))) is different from false [2023-09-01 08:51:05,624 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2171) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2175)) .cse1)) 800)))) is different from false [2023-09-01 08:51:05,637 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2171) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2175)) .cse3)) 800))))) is different from false [2023-09-01 08:51:05,662 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2169 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse3 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2175)) .cse1)) 800)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2171)))) is different from false [2023-09-01 08:51:05,692 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2167 Int) (v_ArrVal_2169 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2167)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2171) (not (= 800 (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse1 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2175)) .cse3))))))) is different from false [2023-09-01 08:51:08,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:51:08,006 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 129 [2023-09-01 08:51:08,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:51:08,016 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 212 treesize of output 212 [2023-09-01 08:51:08,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2023-09-01 08:51:08,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-09-01 08:51:08,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-09-01 08:51:08,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 08:51:08,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 71 [2023-09-01 08:51:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 332 proven. 241 refuted. 48 times theorem prover too weak. 6786 trivial. 268 not checked. [2023-09-01 08:51:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129954329] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:51:10,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:51:10,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 11, 13] total 75 [2023-09-01 08:51:10,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143500729] [2023-09-01 08:51:10,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:51:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-09-01 08:51:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:51:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-09-01 08:51:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1491, Invalid=3349, Unknown=10, NotChecked=700, Total=5550 [2023-09-01 08:51:10,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 402 [2023-09-01 08:51:10,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 282 transitions, 3412 flow. Second operand has 75 states, 75 states have (on average 155.26666666666668) internal successors, (11645), 75 states have internal predecessors, (11645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:51:10,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:51:10,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 402 [2023-09-01 08:51:10,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:52:36,519 INFO L130 PetriNetUnfolder]: 5789/13261 cut-off events. [2023-09-01 08:52:36,519 INFO L131 PetriNetUnfolder]: For 195510/195510 co-relation queries the response was YES. [2023-09-01 08:52:36,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67371 conditions, 13261 events. 5789/13261 cut-off events. For 195510/195510 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 61988 event pairs, 213 based on Foata normal form. 408/13633 useless extension candidates. Maximal degree in co-relation 67288. Up to 2163 conditions per place. [2023-09-01 08:52:36,795 INFO L137 encePairwiseOnDemand]: 386/402 looper letters, 1958 selfloop transitions, 1567 changer transitions 1/3529 dead transitions. [2023-09-01 08:52:36,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 3529 transitions, 35163 flow [2023-09-01 08:52:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 521 states. [2023-09-01 08:52:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2023-09-01 08:52:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 81260 transitions. [2023-09-01 08:52:36,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879833080279982 [2023-09-01 08:52:36,889 INFO L72 ComplementDD]: Start complementDD. Operand 521 states and 81260 transitions. [2023-09-01 08:52:36,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 521 states and 81260 transitions. [2023-09-01 08:52:36,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:52:36,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 521 states and 81260 transitions. [2023-09-01 08:52:37,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 522 states, 521 states have (on average 155.96928982725527) internal successors, (81260), 521 states have internal predecessors, (81260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:52:37,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 522 states, 522 states have (on average 402.0) internal successors, (209844), 522 states have internal predecessors, (209844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:52:37,224 INFO L81 ComplementDD]: Finished complementDD. Result has 522 states, 522 states have (on average 402.0) internal successors, (209844), 522 states have internal predecessors, (209844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:52:37,224 INFO L175 Difference]: Start difference. First operand has 230 places, 282 transitions, 3412 flow. Second operand 521 states and 81260 transitions. [2023-09-01 08:52:37,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 3529 transitions, 35163 flow [2023-09-01 08:52:37,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 3529 transitions, 34944 flow, removed 0 selfloop flow, removed 23 redundant places. [2023-09-01 08:52:37,763 INFO L231 Difference]: Finished difference. Result has 983 places, 1809 transitions, 28626 flow [2023-09-01 08:52:37,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=521, PETRI_FLOW=28626, PETRI_PLACES=983, PETRI_TRANSITIONS=1809} [2023-09-01 08:52:37,765 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 936 predicate places. [2023-09-01 08:52:37,765 INFO L495 AbstractCegarLoop]: Abstraction has has 983 places, 1809 transitions, 28626 flow [2023-09-01 08:52:37,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 155.26666666666668) internal successors, (11645), 75 states have internal predecessors, (11645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:52:37,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:52:37,766 INFO L208 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 38, 38, 38, 38, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:52:37,773 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-09-01 08:52:37,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:52:37,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:52:37,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:52:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1940408699, now seen corresponding path program 4 times [2023-09-01 08:52:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:52:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698237014] [2023-09-01 08:52:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:52:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:52:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:52:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:52:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:52:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698237014] [2023-09-01 08:52:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698237014] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:52:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497471919] [2023-09-01 08:52:41,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 08:52:41,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:52:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:52:41,573 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-09-01 08:52:41,575 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-09-01 08:54:31,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 08:54:31,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:54:31,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 53 conjunts are in the unsatisfiable core [2023-09-01 08:54:31,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:54:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:54:31,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:54:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:54:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497471919] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 08:54:34,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 08:54:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2023-09-01 08:54:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720323315] [2023-09-01 08:54:34,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 08:54:34,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2023-09-01 08:54:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 08:54:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2023-09-01 08:54:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2023-09-01 08:54:35,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-09-01 08:54:35,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1809 transitions, 28626 flow. Second operand has 107 states, 107 states have (on average 206.69158878504672) internal successors, (22116), 107 states have internal predecessors, (22116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:54:35,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 08:54:35,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-09-01 08:54:35,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 08:55:15,395 INFO L130 PetriNetUnfolder]: 10300/25216 cut-off events. [2023-09-01 08:55:15,395 INFO L131 PetriNetUnfolder]: For 19688567/19688567 co-relation queries the response was YES. [2023-09-01 08:55:15,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700714 conditions, 25216 events. 10300/25216 cut-off events. For 19688567/19688567 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 122181 event pairs, 400 based on Foata normal form. 848/26028 useless extension candidates. Maximal degree in co-relation 700374. Up to 6939 conditions per place. [2023-09-01 08:55:16,303 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 3731 selfloop transitions, 522 changer transitions 0/4257 dead transitions. [2023-09-01 08:55:16,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1088 places, 4257 transitions, 144094 flow [2023-09-01 08:55:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-09-01 08:55:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-09-01 08:55:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 22633 transitions. [2023-09-01 08:55:16,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311414624988267 [2023-09-01 08:55:16,324 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 22633 transitions. [2023-09-01 08:55:16,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 22633 transitions. [2023-09-01 08:55:16,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 08:55:16,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 22633 transitions. [2023-09-01 08:55:16,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 213.5188679245283) internal successors, (22633), 106 states have internal predecessors, (22633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:55:16,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 402.0) internal successors, (43014), 107 states have internal predecessors, (43014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:55:16,383 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 402.0) internal successors, (43014), 107 states have internal predecessors, (43014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:55:16,383 INFO L175 Difference]: Start difference. First operand has 983 places, 1809 transitions, 28626 flow. Second operand 106 states and 22633 transitions. [2023-09-01 08:55:16,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1088 places, 4257 transitions, 144094 flow [2023-09-01 08:55:39,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 4257 transitions, 119312 flow, removed 10235 selfloop flow, removed 91 redundant places. [2023-09-01 08:55:39,769 INFO L231 Difference]: Finished difference. Result has 1051 places, 2073 transitions, 22082 flow [2023-09-01 08:55:39,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=16143, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=22082, PETRI_PLACES=1051, PETRI_TRANSITIONS=2073} [2023-09-01 08:55:39,771 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1004 predicate places. [2023-09-01 08:55:39,771 INFO L495 AbstractCegarLoop]: Abstraction has has 1051 places, 2073 transitions, 22082 flow [2023-09-01 08:55:39,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 206.69158878504672) internal successors, (22116), 107 states have internal predecessors, (22116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 08:55:39,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 08:55:39,774 INFO L208 CegarLoopForPetriNet]: trace histogram [104, 104, 104, 104, 77, 77, 77, 77, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 08:55:39,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 08:55:39,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:55:39,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 08:55:39,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 08:55:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 116668732, now seen corresponding path program 5 times [2023-09-01 08:55:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 08:55:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866304596] [2023-09-01 08:55:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 08:55:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 08:55:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 08:55:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 0 proven. 36364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 08:55:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 08:55:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866304596] [2023-09-01 08:55:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866304596] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 08:55:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237758884] [2023-09-01 08:55:50,611 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 08:55:50,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 08:55:50,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 08:55:50,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 08:55:50,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 08:55:53,045 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-09-01 08:55:53,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 08:55:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 197 conjunts are in the unsatisfiable core [2023-09-01 08:55:53,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 08:55:53,141 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-09-01 08:55:53,210 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:55:53,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-09-01 08:55:53,459 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:53,470 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-09-01 08:55:53,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-09-01 08:55:53,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:53,614 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 48 treesize of output 47 [2023-09-01 08:55:53,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2023-09-01 08:55:53,901 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:55:53,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-09-01 08:55:54,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:54,082 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-09-01 08:55:54,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-09-01 08:55:54,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:54,240 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 48 treesize of output 47 [2023-09-01 08:55:54,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-09-01 08:55:54,592 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:55:54,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-09-01 08:55:54,734 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:54,743 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-09-01 08:55:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-09-01 08:55:54,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:54,873 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 48 treesize of output 47 [2023-09-01 08:55:55,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-09-01 08:55:55,237 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-09-01 08:55:55,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-09-01 08:55:55,458 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:55,470 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-09-01 08:55:55,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-09-01 08:55:55,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:55,630 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 48 treesize of output 47 [2023-09-01 08:55:55,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-09-01 08:55:55,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:55,847 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 25 treesize of output 24 [2023-09-01 08:55:56,029 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:56,035 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:55:56,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-09-01 08:55:56,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:56,146 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 23 treesize of output 22 [2023-09-01 08:55:56,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-09-01 08:55:56,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:56,386 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 25 treesize of output 24 [2023-09-01 08:55:56,560 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:56,567 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:55:56,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-09-01 08:55:56,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:56,672 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 23 treesize of output 22 [2023-09-01 08:55:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-09-01 08:55:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:56,884 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 25 treesize of output 24 [2023-09-01 08:55:57,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:57,071 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:55:57,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-09-01 08:55:57,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:57,179 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 23 treesize of output 22 [2023-09-01 08:55:57,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-09-01 08:55:57,403 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-09-01 08:55:57,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-09-01 08:55:57,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 08:55:57,573 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-09-01 08:55:57,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-09-01 08:55:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 08:55:57,667 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 23 treesize of output 22 [2023-09-01 08:55:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 12060 proven. 93 refuted. 0 times theorem prover too weak. 24211 trivial. 0 not checked. [2023-09-01 08:55:57,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 08:58:49,744 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4866 Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 Int) (v_ArrVal_4864 Int) (v_ArrVal_4854 Int) (v_ArrVal_4851 Int) (v_ArrVal_4863 Int) (v_ArrVal_4861 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| Int) (|v_t1Thread1of1ForFork0_~i~0#1_396| Int) (|v_t1Thread1of1ForFork0_~i~0#1_395| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4849)))) (let ((.cse1 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_4853) .cse2 v_ArrVal_4854)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse0 (select .cse9 .cse2)) (.cse3 (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_4861) .cse2 v_ArrVal_4863)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_395| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4864))) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_4854) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (= 800 .cse0) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_4863) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (not (= 800 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse2))) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1))))))))))) is different from false [2023-09-01 08:59:40,689 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4866 Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 Int) (v_ArrVal_4864 Int) (v_ArrVal_4854 Int) (v_ArrVal_4851 Int) (v_ArrVal_4863 Int) (v_ArrVal_4861 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| Int) (|v_t1Thread1of1ForFork0_~i~0#1_396| Int) (|v_t1Thread1of1ForFork0_~i~0#1_395| Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4849))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_4853) .cse2 v_ArrVal_4854)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse1 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse0 (select .cse9 .cse2)) (.cse4 (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_4861) .cse2 v_ArrVal_4863)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_395| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4864))) |c_~#queue~0.base|))) (or (= .cse0 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse5 .cse2) 1) v_ArrVal_4863) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1)) (< (+ .cse0 1) v_ArrVal_4854) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse2) 800))))))))))) is different from false Killed by 15