./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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_longer.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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:08:10,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:08:10,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:08:10,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:08:10,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:08:10,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:08:10,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:08:10,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:08:10,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:08:10,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:08:10,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:08:10,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:08:10,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:08:10,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:08:10,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:08:10,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:08:10,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:08:10,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:08:10,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:08:10,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:08:10,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:08:10,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:08:10,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:08:10,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:08:10,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:08:10,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:08:10,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:08:10,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:08:10,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:08:10,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:08:10,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:08:10,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:08:10,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:08:10,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:08:10,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:08:10,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:08:10,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:08:10,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:08:10,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:08:10,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:08:10,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:08:10,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:08:10,283 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:08:10,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:08:10,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:08:10,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:08:10,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:08:10,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:08:10,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:08:10,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:08:10,287 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:08:10,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:08:10,288 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:08:10,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:08:10,290 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:08:10,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:08:10,290 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:08:10,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:08:10,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:08:10,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:08:10,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:08:10,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:08:10,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:08:10,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:08:10,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:08:10,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:08:10,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:08:10,292 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:08:10,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:08:10,293 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:08:10,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:08:10,293 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:08:10,293 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:08:10,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:08:10,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:08:10,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:08:10,635 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:08:10,635 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:08:10,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 16:08:11,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:08:12,147 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:08:12,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-30 16:08:12,180 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf355803/f3541da3f92747beb433b0fac3474085/FLAG63a1cf524 [2023-08-30 16:08:12,192 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf355803/f3541da3f92747beb433b0fac3474085 [2023-08-30 16:08:12,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:08:12,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:08:12,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:08:12,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:08:12,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:08:12,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5ddc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12, skipping insertion in model container [2023-08-30 16:08:12,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:08:12,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:08:12,630 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_longer.i[43272,43285] [2023-08-30 16:08:12,636 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_longer.i[43545,43558] [2023-08-30 16:08:12,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:08:12,651 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:08:12,711 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_longer.i[43272,43285] [2023-08-30 16:08:12,713 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_longer.i[43545,43558] [2023-08-30 16:08:12,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:08:12,758 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:08:12,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12 WrapperNode [2023-08-30 16:08:12,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:08:12,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:08:12,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:08:12,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:08:12,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,807 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-30 16:08:12,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:08:12,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:08:12,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:08:12,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:08:12,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:08:12,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:08:12,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:08:12,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:08:12,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (1/1) ... [2023-08-30 16:08:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:08:12,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:12,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:08:12,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:08:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-30 16:08:12,934 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-30 16:08:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-30 16:08:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 16:08:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:08:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:08:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:08:12,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:08:12,937 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:08:13,087 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:08:13,102 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:08:13,401 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:08:13,409 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:08:13,409 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 16:08:13,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:08:13 BoogieIcfgContainer [2023-08-30 16:08:13,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:08:13,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:08:13,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:08:13,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:08:13,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:08:12" (1/3) ... [2023-08-30 16:08:13,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124fa6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:08:13, skipping insertion in model container [2023-08-30 16:08:13,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:08:12" (2/3) ... [2023-08-30 16:08:13,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124fa6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:08:13, skipping insertion in model container [2023-08-30 16:08:13,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:08:13" (3/3) ... [2023-08-30 16:08:13,418 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-30 16:08:13,425 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:08:13,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:08:13,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:08:13,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:08:13,599 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 16:08:13,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-08-30 16:08:13,718 INFO L130 PetriNetUnfolder]: 13/214 cut-off events. [2023-08-30 16:08:13,718 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:08:13,727 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-08-30 16:08:13,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-08-30 16:08:13,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-08-30 16:08:13,736 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:08:13,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-30 16:08:13,747 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-30 16:08:13,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-08-30 16:08:13,790 INFO L130 PetriNetUnfolder]: 13/205 cut-off events. [2023-08-30 16:08:13,790 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:08:13,792 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-08-30 16:08:13,797 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-08-30 16:08:20,576 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-08-30 16:08:20,577 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-30 16:08:20,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:08:20,613 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;@6b1afd46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:08:20,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:08:20,615 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 16:08:20,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:08:20,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:20,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 16:08:20,618 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-08-30 16:08:20,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-08-30 16:08:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:20,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137989021] [2023-08-30 16:08:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137989021] [2023-08-30 16:08:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137989021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:08:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:08:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 16:08:20,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807140955] [2023-08-30 16:08:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:08:20,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:08:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:08:20,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:08:20,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-08-30 16:08:20,825 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-08-30 16:08:20,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:20,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-08-30 16:08:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:21,094 INFO L130 PetriNetUnfolder]: 829/1341 cut-off events. [2023-08-30 16:08:21,095 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 16:08:21,099 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-08-30 16:08:21,106 INFO L137 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-08-30 16:08:21,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-08-30 16:08:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:08:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:08:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-08-30 16:08:21,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-08-30 16:08:21,131 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-08-30 16:08:21,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-08-30 16:08:21,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:21,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-08-30 16:08:21,143 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-08-30 16:08:21,149 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-08-30 16:08:21,150 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-08-30 16:08:21,151 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-08-30 16:08:21,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-08-30 16:08:21,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:08:21,157 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-08-30 16:08:21,159 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-08-30 16:08:21,162 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-30 16:08:21,162 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-08-30 16:08:21,163 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-08-30 16:08:21,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:21,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:08:21,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:08:21,166 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-08-30 16:08:21,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-08-30 16:08:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555974287] [2023-08-30 16:08:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:21,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555974287] [2023-08-30 16:08:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555974287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:08:21,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:08:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:08:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059626896] [2023-08-30 16:08:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:08:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:08:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:08:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:08:21,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:08:21,445 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-08-30 16:08:21,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:21,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:08:21,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:21,529 INFO L130 PetriNetUnfolder]: 197/403 cut-off events. [2023-08-30 16:08:21,529 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-30 16:08:21,530 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-08-30 16:08:21,532 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 5/52 dead transitions. [2023-08-30 16:08:21,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 203 flow [2023-08-30 16:08:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:08:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:08:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2023-08-30 16:08:21,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364842454394693 [2023-08-30 16:08:21,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2023-08-30 16:08:21,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2023-08-30 16:08:21,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:21,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2023-08-30 16:08:21,537 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-08-30 16:08:21,540 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-08-30 16:08:21,541 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-08-30 16:08:21,541 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 647 transitions. [2023-08-30 16:08:21,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 203 flow [2023-08-30 16:08:21,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:08:21,543 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 98 flow [2023-08-30 16:08:21,543 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-08-30 16:08:21,544 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-30 16:08:21,544 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 98 flow [2023-08-30 16:08:21,544 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-08-30 16:08:21,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:21,545 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-08-30 16:08:21,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:08:21,545 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-08-30 16:08:21,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-08-30 16:08:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105717745] [2023-08-30 16:08:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105717745] [2023-08-30 16:08:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105717745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:08:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:08:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:08:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425793378] [2023-08-30 16:08:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:08:21,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:08:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:21,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:08:21,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:08:21,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 402 [2023-08-30 16:08:21,630 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-08-30 16:08:21,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:21,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 402 [2023-08-30 16:08:21,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:21,727 INFO L130 PetriNetUnfolder]: 245/498 cut-off events. [2023-08-30 16:08:21,728 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 16:08:21,729 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-08-30 16:08:21,730 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-30 16:08:21,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 230 flow [2023-08-30 16:08:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:08:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:08:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2023-08-30 16:08:21,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543117744610282 [2023-08-30 16:08:21,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2023-08-30 16:08:21,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2023-08-30 16:08:21,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:21,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2023-08-30 16:08:21,735 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-08-30 16:08:21,737 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-08-30 16:08:21,738 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-08-30 16:08:21,739 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 98 flow. Second operand 3 states and 655 transitions. [2023-08-30 16:08:21,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 230 flow [2023-08-30 16:08:21,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:08:21,740 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 113 flow [2023-08-30 16:08:21,741 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-08-30 16:08:21,741 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-30 16:08:21,742 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 113 flow [2023-08-30 16:08:21,742 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-08-30 16:08:21,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:21,742 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-08-30 16:08:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:08:21,743 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-08-30 16:08:21,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-08-30 16:08:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078187] [2023-08-30 16:08:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078187] [2023-08-30 16:08:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:08:21,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:08:21,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:08:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994800276] [2023-08-30 16:08:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:08:21,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:08:21,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:21,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:08:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:08:21,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-08-30 16:08:21,887 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-08-30 16:08:21,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:21,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-08-30 16:08:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:21,993 INFO L130 PetriNetUnfolder]: 230/513 cut-off events. [2023-08-30 16:08:21,993 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 16:08:21,994 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-08-30 16:08:21,995 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 43 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-30 16:08:21,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 222 flow [2023-08-30 16:08:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:08:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:08:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-30 16:08:21,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339966832504146 [2023-08-30 16:08:21,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-30 16:08:22,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-30 16:08:22,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:22,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-30 16:08:22,005 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-08-30 16:08:22,007 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-08-30 16:08:22,008 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-08-30 16:08:22,008 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 113 flow. Second operand 3 states and 644 transitions. [2023-08-30 16:08:22,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 222 flow [2023-08-30 16:08:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:08:22,012 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 114 flow [2023-08-30 16:08:22,012 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-08-30 16:08:22,013 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2023-08-30 16:08:22,014 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 114 flow [2023-08-30 16:08:22,014 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-08-30 16:08:22,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:22,015 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-08-30 16:08:22,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:08:22,015 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-08-30 16:08:22,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-08-30 16:08:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936263419] [2023-08-30 16:08:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936263419] [2023-08-30 16:08:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936263419] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868331156] [2023-08-30 16:08:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:22,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:22,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 16:08:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:22,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 16:08:22,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:22,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868331156] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:22,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 16:08:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222645620] [2023-08-30 16:08:22,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:22,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:08:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:08:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:08:22,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:08:22,386 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-08-30 16:08:22,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:22,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:08:22,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:22,560 INFO L130 PetriNetUnfolder]: 246/536 cut-off events. [2023-08-30 16:08:22,560 INFO L131 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2023-08-30 16:08:22,561 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-08-30 16:08:22,563 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2023-08-30 16:08:22,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 372 flow [2023-08-30 16:08:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:08:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:08:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2023-08-30 16:08:22,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319237147595357 [2023-08-30 16:08:22,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1283 transitions. [2023-08-30 16:08:22,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1283 transitions. [2023-08-30 16:08:22,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:22,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1283 transitions. [2023-08-30 16:08:22,571 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-08-30 16:08:22,575 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-08-30 16:08:22,576 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-08-30 16:08:22,577 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 114 flow. Second operand 6 states and 1283 transitions. [2023-08-30 16:08:22,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 372 flow [2023-08-30 16:08:22,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:08:22,580 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 172 flow [2023-08-30 16:08:22,580 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-08-30 16:08:22,582 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-30 16:08:22,582 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 172 flow [2023-08-30 16:08:22,583 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-08-30 16:08:22,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:22,584 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-08-30 16:08:22,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 16:08:22,790 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-08-30 16:08:22,791 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-08-30 16:08:22,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-08-30 16:08:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580660661] [2023-08-30 16:08:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580660661] [2023-08-30 16:08:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580660661] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364342297] [2023-08-30 16:08:23,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:08:23,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:23,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:23,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:23,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 16:08:23,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 16:08:23,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:08:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 16:08:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:23,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364342297] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:23,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-30 16:08:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457669217] [2023-08-30 16:08:23,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:23,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 16:08:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 16:08:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 16:08:23,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:08:23,378 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-08-30 16:08:23,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:23,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:08:23,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:23,727 INFO L130 PetriNetUnfolder]: 423/937 cut-off events. [2023-08-30 16:08:23,728 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2023-08-30 16:08:23,729 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-08-30 16:08:23,732 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2023-08-30 16:08:23,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 838 flow [2023-08-30 16:08:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 16:08:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 16:08:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2564 transitions. [2023-08-30 16:08:23,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315091210613598 [2023-08-30 16:08:23,741 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2564 transitions. [2023-08-30 16:08:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2564 transitions. [2023-08-30 16:08:23,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:23,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2564 transitions. [2023-08-30 16:08:23,749 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-08-30 16:08:23,757 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-08-30 16:08:23,758 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-08-30 16:08:23,758 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 172 flow. Second operand 12 states and 2564 transitions. [2023-08-30 16:08:23,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 162 transitions, 838 flow [2023-08-30 16:08:23,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 162 transitions, 799 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-30 16:08:23,767 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 322 flow [2023-08-30 16:08:23,768 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-08-30 16:08:23,770 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2023-08-30 16:08:23,770 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 322 flow [2023-08-30 16:08:23,771 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-08-30 16:08:23,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:23,772 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-08-30 16:08:23,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 16:08:23,978 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-08-30 16:08:23,979 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-08-30 16:08:23,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-08-30 16:08:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568486854] [2023-08-30 16:08:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568486854] [2023-08-30 16:08:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568486854] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135847746] [2023-08-30 16:08:24,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:08:24,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:24,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:24,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 16:08:24,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 16:08:24,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:08:24,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 16:08:24,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:25,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 16:08:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:08:25,296 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-08-30 16:08:25,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:08:25,363 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 16:08:25,364 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-08-30 16:08:25,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:08:25,401 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-08-30 16:08:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-08-30 16:08:25,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:25,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:25,598 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-08-30 16:08:25,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:25,615 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-08-30 16:08:25,626 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-08-30 16:08:25,656 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-08-30 16:08:25,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:25,687 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-08-30 16:08:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-08-30 16:08:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135847746] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:25,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2023-08-30 16:08:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98714738] [2023-08-30 16:08:25,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 16:08:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:25,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 16:08:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=475, Unknown=6, NotChecked=0, Total=600 [2023-08-30 16:08:29,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:08:29,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 402 [2023-08-30 16:08:29,459 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-08-30 16:08:29,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:29,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 402 [2023-08-30 16:08:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:31,201 INFO L130 PetriNetUnfolder]: 821/1809 cut-off events. [2023-08-30 16:08:31,201 INFO L131 PetriNetUnfolder]: For 1316/1316 co-relation queries the response was YES. [2023-08-30 16:08:31,204 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-08-30 16:08:31,211 INFO L137 encePairwiseOnDemand]: 390/402 looper letters, 267 selfloop transitions, 110 changer transitions 1/381 dead transitions. [2023-08-30 16:08:31,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 381 transitions, 2042 flow [2023-08-30 16:08:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-30 16:08:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-30 16:08:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6885 transitions. [2023-08-30 16:08:31,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3982992016660882 [2023-08-30 16:08:31,229 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6885 transitions. [2023-08-30 16:08:31,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6885 transitions. [2023-08-30 16:08:31,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:31,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6885 transitions. [2023-08-30 16:08:31,265 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-08-30 16:08:31,290 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-08-30 16:08:31,306 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-08-30 16:08:31,306 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 322 flow. Second operand 43 states and 6885 transitions. [2023-08-30 16:08:31,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 381 transitions, 2042 flow [2023-08-30 16:08:31,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 381 transitions, 2027 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:08:31,318 INFO L231 Difference]: Finished difference. Result has 135 places, 164 transitions, 1174 flow [2023-08-30 16:08:31,318 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-08-30 16:08:31,318 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 88 predicate places. [2023-08-30 16:08:31,319 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 164 transitions, 1174 flow [2023-08-30 16:08:31,320 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-08-30 16:08:31,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:31,321 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-08-30 16:08:31,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 16:08:31,529 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-08-30 16:08:31,529 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-08-30 16:08:31,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash -161773555, now seen corresponding path program 1 times [2023-08-30 16:08:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892910690] [2023-08-30 16:08:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892910690] [2023-08-30 16:08:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892910690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959728042] [2023-08-30 16:08:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:32,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:32,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:32,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:32,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 16:08:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:32,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 16:08:32,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:32,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959728042] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:32,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-08-30 16:08:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538399397] [2023-08-30 16:08:32,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:32,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 16:08:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 16:08:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-08-30 16:08:32,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:08:32,740 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-08-30 16:08:32,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:32,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:08:32,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:33,971 INFO L130 PetriNetUnfolder]: 1371/3215 cut-off events. [2023-08-30 16:08:33,971 INFO L131 PetriNetUnfolder]: For 28289/28289 co-relation queries the response was YES. [2023-08-30 16:08:33,984 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-08-30 16:08:33,999 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 413 selfloop transitions, 75 changer transitions 0/492 dead transitions. [2023-08-30 16:08:33,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 492 transitions, 5505 flow [2023-08-30 16:08:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 16:08:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 16:08:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5553 transitions. [2023-08-30 16:08:34,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312858783008036 [2023-08-30 16:08:34,011 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5553 transitions. [2023-08-30 16:08:34,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5553 transitions. [2023-08-30 16:08:34,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:34,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5553 transitions. [2023-08-30 16:08:34,024 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-08-30 16:08:34,037 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-08-30 16:08:34,039 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-08-30 16:08:34,039 INFO L175 Difference]: Start difference. First operand has 135 places, 164 transitions, 1174 flow. Second operand 26 states and 5553 transitions. [2023-08-30 16:08:34,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 492 transitions, 5505 flow [2023-08-30 16:08:34,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 492 transitions, 5318 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-30 16:08:34,114 INFO L231 Difference]: Finished difference. Result has 163 places, 202 transitions, 1744 flow [2023-08-30 16:08:34,115 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-08-30 16:08:34,117 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 116 predicate places. [2023-08-30 16:08:34,117 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 202 transitions, 1744 flow [2023-08-30 16:08:34,118 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-08-30 16:08:34,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:34,119 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-08-30 16:08:34,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 16:08:34,325 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-08-30 16:08:34,326 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-08-30 16:08:34,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash -346057744, now seen corresponding path program 2 times [2023-08-30 16:08:34,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545481554] [2023-08-30 16:08:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:35,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545481554] [2023-08-30 16:08:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545481554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:35,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941253588] [2023-08-30 16:08:35,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 16:08:35,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:35,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:35,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:35,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 16:08:36,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 16:08:36,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:08:36,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 16:08:36,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:36,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941253588] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:37,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2023-08-30 16:08:37,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403046747] [2023-08-30 16:08:37,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:37,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-08-30 16:08:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-08-30 16:08:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2023-08-30 16:08:37,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:08:37,457 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-08-30 16:08:37,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:37,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:08:37,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:08:40,485 INFO L130 PetriNetUnfolder]: 2697/6387 cut-off events. [2023-08-30 16:08:40,485 INFO L131 PetriNetUnfolder]: For 100006/100006 co-relation queries the response was YES. [2023-08-30 16:08:40,512 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-08-30 16:08:40,538 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 829 selfloop transitions, 153 changer transitions 0/986 dead transitions. [2023-08-30 16:08:40,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 986 transitions, 11797 flow [2023-08-30 16:08:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-30 16:08:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-30 16:08:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 11104 transitions. [2023-08-30 16:08:40,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311902028319939 [2023-08-30 16:08:40,553 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 11104 transitions. [2023-08-30 16:08:40,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 11104 transitions. [2023-08-30 16:08:40,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:08:40,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 11104 transitions. [2023-08-30 16:08:40,570 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-08-30 16:08:40,589 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-08-30 16:08:40,592 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-08-30 16:08:40,592 INFO L175 Difference]: Start difference. First operand has 163 places, 202 transitions, 1744 flow. Second operand 52 states and 11104 transitions. [2023-08-30 16:08:40,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 986 transitions, 11797 flow [2023-08-30 16:08:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 986 transitions, 11734 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-30 16:08:40,800 INFO L231 Difference]: Finished difference. Result has 230 places, 282 transitions, 3412 flow [2023-08-30 16:08:40,801 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-08-30 16:08:40,802 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 183 predicate places. [2023-08-30 16:08:40,802 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 282 transitions, 3412 flow [2023-08-30 16:08:40,804 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-08-30 16:08:40,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:08:40,805 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-08-30 16:08:40,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 16:08:41,013 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-08-30 16:08:41,013 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-08-30 16:08:41,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:08:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 890330880, now seen corresponding path program 3 times [2023-08-30 16:08:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:08:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732646335] [2023-08-30 16:08:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:08:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:08:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:08:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 0 proven. 7675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:08:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:08:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732646335] [2023-08-30 16:08:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732646335] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:08:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150167424] [2023-08-30 16:08:44,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 16:08:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:08:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:08:44,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:08:44,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 16:08:46,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-30 16:08:46,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:08:46,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-30 16:08:46,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:08:48,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 16:08:48,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:08:48,330 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-08-30 16:08:48,435 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 16:08:48,436 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 28 treesize of output 23 [2023-08-30 16:08:48,511 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-08-30 16:08:48,615 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 25 treesize of output 13 [2023-08-30 16:08:48,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:08:48,665 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-08-30 16:08:48,777 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 16:08:48,778 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-30 16:08:48,835 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-08-30 16:08:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 644 proven. 245 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2023-08-30 16:08:48,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:08:48,983 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |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))))) is different from false [2023-08-30 16:08:48,992 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |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))))) is different from false [2023-08-30 16:08:49,000 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |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))))) is different from false [2023-08-30 16:08:49,012 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_2175 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2175)) .cse2)))))))) is different from false [2023-08-30 16:08:49,024 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2175 Int) (v_ArrVal_2169 Int) (v_ArrVal_2173 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse3 (+ .cse4 1))) |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))))) (= 400 .cse4)))) is different from false [2023-08-30 16:08:49,044 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2167 Int) (v_ArrVal_2169 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse2 (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)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse3 (+ .cse4 1))) |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)) 400)) (= .cse4 400))))) is different from false [2023-08-30 16:08:49,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:49,386 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 233 treesize of output 163 [2023-08-30 16:08:49,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:49,402 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 262 treesize of output 258 [2023-08-30 16:08:49,418 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 97 treesize of output 85 [2023-08-30 16:08:49,435 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-08-30 16:08:49,461 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-08-30 16:08:49,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 16:08:49,486 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 123 treesize of output 107 [2023-08-30 16:08:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 332 proven. 289 refuted. 0 times theorem prover too weak. 6786 trivial. 268 not checked. [2023-08-30 16:08:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150167424] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:08:50,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:08:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 11, 14] total 76 [2023-08-30 16:08:50,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436939686] [2023-08-30 16:08:50,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:08:50,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-08-30 16:08:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:08:50,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-08-30 16:08:50,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=3359, Unknown=7, NotChecked=846, Total=5700 [2023-08-30 16:08:50,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 402 [2023-08-30 16:08:50,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 282 transitions, 3412 flow. Second operand has 76 states, 76 states have (on average 155.18421052631578) internal successors, (11794), 76 states have internal predecessors, (11794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:08:50,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:08:50,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 402 [2023-08-30 16:08:50,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:10:34,158 INFO L130 PetriNetUnfolder]: 5887/13506 cut-off events. [2023-08-30 16:10:34,158 INFO L131 PetriNetUnfolder]: For 195853/195853 co-relation queries the response was YES. [2023-08-30 16:10:34,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68109 conditions, 13506 events. 5887/13506 cut-off events. For 195853/195853 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 63654 event pairs, 213 based on Foata normal form. 408/13878 useless extension candidates. Maximal degree in co-relation 68026. Up to 2163 conditions per place. [2023-08-30 16:10:34,313 INFO L137 encePairwiseOnDemand]: 386/402 looper letters, 2010 selfloop transitions, 1717 changer transitions 1/3731 dead transitions. [2023-08-30 16:10:34,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 3731 transitions, 36321 flow [2023-08-30 16:10:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 573 states. [2023-08-30 16:10:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2023-08-30 16:10:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 89210 transitions. [2023-08-30 16:10:34,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38728695093468085 [2023-08-30 16:10:34,406 INFO L72 ComplementDD]: Start complementDD. Operand 573 states and 89210 transitions. [2023-08-30 16:10:34,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 573 states and 89210 transitions. [2023-08-30 16:10:34,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:10:34,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 573 states and 89210 transitions. [2023-08-30 16:10:34,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 574 states, 573 states have (on average 155.68935427574172) internal successors, (89210), 573 states have internal predecessors, (89210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:10:34,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 574 states, 574 states have (on average 402.0) internal successors, (230748), 574 states have internal predecessors, (230748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:10:34,756 INFO L81 ComplementDD]: Finished complementDD. Result has 574 states, 574 states have (on average 402.0) internal successors, (230748), 574 states have internal predecessors, (230748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:10:34,756 INFO L175 Difference]: Start difference. First operand has 230 places, 282 transitions, 3412 flow. Second operand 573 states and 89210 transitions. [2023-08-30 16:10:34,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 3731 transitions, 36321 flow [2023-08-30 16:10:35,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 779 places, 3731 transitions, 36102 flow, removed 0 selfloop flow, removed 23 redundant places. [2023-08-30 16:10:35,246 INFO L231 Difference]: Finished difference. Result has 985 places, 1958 transitions, 30295 flow [2023-08-30 16:10:35,247 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=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=573, PETRI_FLOW=30295, PETRI_PLACES=985, PETRI_TRANSITIONS=1958} [2023-08-30 16:10:35,247 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 938 predicate places. [2023-08-30 16:10:35,247 INFO L495 AbstractCegarLoop]: Abstraction has has 985 places, 1958 transitions, 30295 flow [2023-08-30 16:10:35,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 155.18421052631578) internal successors, (11794), 76 states have internal predecessors, (11794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:10:35,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:10:35,249 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-08-30 16:10:35,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 16:10:35,449 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-08-30 16:10:35,450 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-08-30 16:10:35,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:10:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1940408699, now seen corresponding path program 4 times [2023-08-30 16:10:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:10:35,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624409472] [2023-08-30 16:10:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:10:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:10:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:10:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:10:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:10:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624409472] [2023-08-30 16:10:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624409472] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:10:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886349507] [2023-08-30 16:10:39,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 16:10:39,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:10:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:10:39,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:10:39,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 16:12:34,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 16:12:34,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:12:34,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-30 16:12:34,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:12:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:12:35,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:12:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:12:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886349507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:12:38,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:12:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2023-08-30 16:12:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110849179] [2023-08-30 16:12:38,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:12:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2023-08-30 16:12:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:12:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2023-08-30 16:12:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2023-08-30 16:12:38,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 402 [2023-08-30 16:12:38,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 1958 transitions, 30295 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-08-30 16:12:38,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:12:38,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 402 [2023-08-30 16:12:38,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:13:18,087 INFO L130 PetriNetUnfolder]: 10502/25722 cut-off events. [2023-08-30 16:13:18,088 INFO L131 PetriNetUnfolder]: For 17221461/17221461 co-relation queries the response was YES. [2023-08-30 16:13:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669997 conditions, 25722 events. 10502/25722 cut-off events. For 17221461/17221461 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 125567 event pairs, 394 based on Foata normal form. 848/26534 useless extension candidates. Maximal degree in co-relation 669707. Up to 7141 conditions per place. [2023-08-30 16:13:19,106 INFO L137 encePairwiseOnDemand]: 397/402 looper letters, 3933 selfloop transitions, 522 changer transitions 0/4459 dead transitions. [2023-08-30 16:13:19,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1090 places, 4459 transitions, 124709 flow [2023-08-30 16:13:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-08-30 16:13:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-08-30 16:13:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 22633 transitions. [2023-08-30 16:13:19,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311414624988267 [2023-08-30 16:13:19,126 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 22633 transitions. [2023-08-30 16:13:19,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 22633 transitions. [2023-08-30 16:13:19,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:13:19,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 22633 transitions. [2023-08-30 16:13:19,158 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-08-30 16:13:19,188 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-08-30 16:13:19,194 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-08-30 16:13:19,194 INFO L175 Difference]: Start difference. First operand has 985 places, 1958 transitions, 30295 flow. Second operand 106 states and 22633 transitions. [2023-08-30 16:13:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1090 places, 4459 transitions, 124709 flow [2023-08-30 16:13:35,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 4459 transitions, 93650 flow, removed 12901 selfloop flow, removed 103 redundant places. [2023-08-30 16:13:35,081 INFO L231 Difference]: Finished difference. Result has 1041 places, 2222 transitions, 20438 flow [2023-08-30 16:13:35,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=14503, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=20438, PETRI_PLACES=1041, PETRI_TRANSITIONS=2222} [2023-08-30 16:13:35,083 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 994 predicate places. [2023-08-30 16:13:35,083 INFO L495 AbstractCegarLoop]: Abstraction has has 1041 places, 2222 transitions, 20438 flow [2023-08-30 16:13:35,085 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-08-30 16:13:35,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:13:35,086 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-08-30 16:13:35,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-30 16:13:35,289 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-08-30 16:13:35,289 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-08-30 16:13:35,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:13:35,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1986383804, now seen corresponding path program 5 times [2023-08-30 16:13:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:13:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528856732] [2023-08-30 16:13:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:13:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:13:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:13:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 0 proven. 36364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:13:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:13:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528856732] [2023-08-30 16:13:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528856732] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:13:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904939998] [2023-08-30 16:13:46,097 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 16:13:46,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:13:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:13:46,098 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-08-30 16:13:46,100 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-08-30 16:13:48,606 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-08-30 16:13:48,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 16:13:48,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 201 conjunts are in the unsatisfiable core [2023-08-30 16:13:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:13:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 16:13:48,781 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 16:13:48,782 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 26 treesize of output 39 [2023-08-30 16:13:48,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:48,954 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 16:13:48,954 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 45 treesize of output 47 [2023-08-30 16:13:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:49,073 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 37 treesize of output 36 [2023-08-30 16:13:49,282 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 55 treesize of output 33 [2023-08-30 16:13:49,370 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 16:13:49,370 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 57 [2023-08-30 16:13:49,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:49,661 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 16:13:49,661 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 70 treesize of output 66 [2023-08-30 16:13:49,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:49,834 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 62 treesize of output 55 [2023-08-30 16:13:50,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 80 treesize of output 52 [2023-08-30 16:13:50,240 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 16:13:50,240 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 75 treesize of output 76 [2023-08-30 16:13:50,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:50,526 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 16:13:50,526 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 95 treesize of output 85 [2023-08-30 16:13:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:50,732 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 87 treesize of output 74 [2023-08-30 16:13:51,072 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 105 treesize of output 71 [2023-08-30 16:13:51,223 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-30 16:13:51,223 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 99 treesize of output 94 [2023-08-30 16:13:51,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:51,573 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-30 16:13:51,574 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 56 treesize of output 58 [2023-08-30 16:13:51,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:51,705 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-08-30 16:13:51,846 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-08-30 16:13:51,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:51,934 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-08-30 16:13:52,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:52,172 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 16:13:52,172 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-08-30 16:13:52,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:52,275 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-08-30 16:13:52,420 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-08-30 16:13:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:52,503 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-08-30 16:13:52,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:52,696 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 16:13:52,697 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-08-30 16:13:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:52,801 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-08-30 16:13:52,935 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-08-30 16:13:53,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:53,027 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-08-30 16:13:53,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:53,248 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 16:13:53,248 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-08-30 16:13:53,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:53,369 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-08-30 16:13:53,534 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-08-30 16:13:53,652 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-08-30 16:13:53,652 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-08-30 16:13:53,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:13:53,810 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-30 16:13:53,810 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-08-30 16:13:53,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:13:53,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 23 treesize of output 22 [2023-08-30 16:13:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 12020 proven. 133 refuted. 0 times theorem prover too weak. 24211 trivial. 0 not checked. [2023-08-30 16:13:53,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:15:55,817 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 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_502| Int) (|v_t1Thread1of1ForFork0_~i~0#1_395| Int)) (let ((.cse4 (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_4851)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4853) .cse5 v_ArrVal_4854)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4856))))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_4861) .cse1 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 (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_4863) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_4854) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse1) 400)))))))) is different from false [2023-08-30 16:18:41,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4847 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 ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_4847)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4849))))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_4853) .cse1 v_ArrVal_4854)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse0 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_4861) .cse1 v_ArrVal_4863)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |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 (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse1) 400) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_4847) (< (+ (select .cse5 .cse1) 1) v_ArrVal_4863) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_4854))))))))))) is different from false [2023-08-30 16:19:59,651 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4847 Int) (v_ArrVal_4866 Int) (v_ArrVal_4845 Int) (v_ArrVal_4856 Int) (v_ArrVal_4842 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 ((.cse4 (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_4842)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4845) .cse5 v_ArrVal_4847)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4849))))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_4853) .cse1 v_ArrVal_4854)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse6 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_4861) .cse1 v_ArrVal_4863)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |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 (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_4863) (< (+ (select .cse4 .cse5) 1) v_ArrVal_4847) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse1) 400) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_4854))))))))))) is different from false Killed by 15