./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/weaver/parallel-misc-1.wvr.c -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 c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 01:54:19,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 01:54:19,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 01:54:19,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 01:54:19,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 01:54:19,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 01:54:19,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 01:54:19,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 01:54:19,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 01:54:19,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 01:54:19,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 01:54:19,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 01:54:19,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 01:54:19,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 01:54:19,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 01:54:19,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 01:54:19,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 01:54:19,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 01:54:19,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 01:54:19,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 01:54:19,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 01:54:19,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 01:54:19,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 01:54:19,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 01:54:19,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 01:54:19,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 01:54:19,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 01:54:19,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 01:54:19,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 01:54:19,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 01:54:19,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 01:54:19,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 01:54:19,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 01:54:19,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 01:54:19,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 01:54:19,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 01:54:19,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 01:54:19,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 01:54:19,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 01:54:19,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 01:54:19,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 01:54:19,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-31 01:54:19,227 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 01:54:19,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 01:54:19,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 01:54:19,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 01:54:19,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 01:54:19,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 01:54:19,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 01:54:19,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 01:54:19,231 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 01:54:19,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 01:54:19,232 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 01:54:19,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 01:54:19,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 01:54:19,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 01:54:19,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-31 01:54:19,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 01:54:19,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-31 01:54:19,233 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 01:54:19,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-31 01:54:19,234 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 01:54:19,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-31 01:54:19,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 01:54:19,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 01:54:19,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 01:54:19,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:54:19,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 01:54:19,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 01:54:19,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-31 01:54:19,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 01:54:19,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 01:54:19,236 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 01:54:19,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-31 01:54:19,236 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 01:54:19,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 01:54:19,237 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 01:54:19,237 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 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 -> TOGETHER [2023-08-31 01:54:19,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 01:54:19,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 01:54:19,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 01:54:19,561 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 01:54:19,561 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 01:54:19,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-08-31 01:54:20,671 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 01:54:20,883 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 01:54:20,884 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-08-31 01:54:20,890 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50fa3ab7d/a653b210643946e48725e4567c97989d/FLAGd71f030fd [2023-08-31 01:54:20,902 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50fa3ab7d/a653b210643946e48725e4567c97989d [2023-08-31 01:54:20,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 01:54:20,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 01:54:20,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 01:54:20,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 01:54:20,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 01:54:20,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:54:20" (1/1) ... [2023-08-31 01:54:20,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0157e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:20, skipping insertion in model container [2023-08-31 01:54:20,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:54:20" (1/1) ... [2023-08-31 01:54:20,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 01:54:20,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 01:54:21,139 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-08-31 01:54:21,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:54:21,171 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 01:54:21,210 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-08-31 01:54:21,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 01:54:21,235 INFO L208 MainTranslator]: Completed translation [2023-08-31 01:54:21,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21 WrapperNode [2023-08-31 01:54:21,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 01:54:21,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 01:54:21,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 01:54:21,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 01:54:21,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,310 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 287 [2023-08-31 01:54:21,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 01:54:21,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 01:54:21,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 01:54:21,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 01:54:21,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 01:54:21,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 01:54:21,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 01:54:21,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 01:54:21,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (1/1) ... [2023-08-31 01:54:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 01:54:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:54:21,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 01:54:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 01:54:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 01:54:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 01:54:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 01:54:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 01:54:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 01:54:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 01:54:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 01:54:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 01:54:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 01:54:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 01:54:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 01:54:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 01:54:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 01:54:21,470 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 01:54:21,583 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 01:54:21,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 01:54:22,064 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 01:54:22,079 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 01:54:22,079 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-31 01:54:22,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:54:22 BoogieIcfgContainer [2023-08-31 01:54:22,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 01:54:22,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 01:54:22,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 01:54:22,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 01:54:22,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 01:54:20" (1/3) ... [2023-08-31 01:54:22,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e84e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:54:22, skipping insertion in model container [2023-08-31 01:54:22,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:54:21" (2/3) ... [2023-08-31 01:54:22,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e84e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 01:54:22, skipping insertion in model container [2023-08-31 01:54:22,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:54:22" (3/3) ... [2023-08-31 01:54:22,089 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-08-31 01:54:22,099 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-31 01:54:22,108 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 01:54:22,109 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-31 01:54:22,109 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 01:54:22,265 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 01:54:22,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 346 transitions, 708 flow [2023-08-31 01:54:22,463 INFO L130 PetriNetUnfolder]: 28/344 cut-off events. [2023-08-31 01:54:22,464 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:54:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 344 events. 28/344 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 768 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-08-31 01:54:22,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 346 transitions, 708 flow [2023-08-31 01:54:22,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 336 transitions, 684 flow [2023-08-31 01:54:22,489 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 01:54:22,505 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 336 transitions, 684 flow [2023-08-31 01:54:22,513 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 336 transitions, 684 flow [2023-08-31 01:54:22,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 684 flow [2023-08-31 01:54:22,613 INFO L130 PetriNetUnfolder]: 28/336 cut-off events. [2023-08-31 01:54:22,614 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:54:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 336 events. 28/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 761 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-08-31 01:54:22,632 INFO L119 LiptonReduction]: Number of co-enabled transitions 25652 [2023-08-31 01:54:32,422 INFO L134 LiptonReduction]: Checked pairs total: 22140 [2023-08-31 01:54:32,422 INFO L136 LiptonReduction]: Total number of compositions: 413 [2023-08-31 01:54:32,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 01:54:32,439 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;@7fed821e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 01:54:32,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-31 01:54:32,444 INFO L130 PetriNetUnfolder]: 4/16 cut-off events. [2023-08-31 01:54:32,444 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 01:54:32,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:32,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:32,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:32,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash 200185486, now seen corresponding path program 1 times [2023-08-31 01:54:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265359359] [2023-08-31 01:54:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:33,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265359359] [2023-08-31 01:54:33,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265359359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:54:33,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:54:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 01:54:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152695121] [2023-08-31 01:54:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:33,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 01:54:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 01:54:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 01:54:33,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 759 [2023-08-31 01:54:33,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 305.4) internal successors, (1527), 5 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:33,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 759 [2023-08-31 01:54:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:33,617 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2023-08-31 01:54:33,617 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-31 01:54:33,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2023-08-31 01:54:33,620 INFO L137 encePairwiseOnDemand]: 752/759 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2023-08-31 01:54:33,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2023-08-31 01:54:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1563 transitions. [2023-08-31 01:54:33,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41185770750988143 [2023-08-31 01:54:33,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1563 transitions. [2023-08-31 01:54:33,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1563 transitions. [2023-08-31 01:54:33,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:33,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1563 transitions. [2023-08-31 01:54:33,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 312.6) internal successors, (1563), 5 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,664 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 46 flow. Second operand 5 states and 1563 transitions. [2023-08-31 01:54:33,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 43 transitions, 199 flow [2023-08-31 01:54:33,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 01:54:33,669 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2023-08-31 01:54:33,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=25} [2023-08-31 01:54:33,674 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-08-31 01:54:33,674 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 99 flow [2023-08-31 01:54:33,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.4) internal successors, (1527), 5 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:33,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:33,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 01:54:33,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:33,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash -419197718, now seen corresponding path program 1 times [2023-08-31 01:54:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465601084] [2023-08-31 01:54:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:33,787 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-31 01:54:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465601084] [2023-08-31 01:54:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465601084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:54:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:54:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 01:54:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111542545] [2023-08-31 01:54:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:33,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:54:33,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:54:33,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:54:33,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 759 [2023-08-31 01:54:33,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 309.25) internal successors, (1237), 4 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:33,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 759 [2023-08-31 01:54:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:33,957 INFO L130 PetriNetUnfolder]: 109/196 cut-off events. [2023-08-31 01:54:33,958 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-31 01:54:33,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 196 events. 109/196 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 634 event pairs, 17 based on Foata normal form. 8/196 useless extension candidates. Maximal degree in co-relation 258. Up to 69 conditions per place. [2023-08-31 01:54:33,959 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2023-08-31 01:54:33,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 54 transitions, 307 flow [2023-08-31 01:54:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1572 transitions. [2023-08-31 01:54:33,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142292490118577 [2023-08-31 01:54:33,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1572 transitions. [2023-08-31 01:54:33,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1572 transitions. [2023-08-31 01:54:33,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:33,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1572 transitions. [2023-08-31 01:54:33,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.4) internal successors, (1572), 5 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,976 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,977 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 99 flow. Second operand 5 states and 1572 transitions. [2023-08-31 01:54:33,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 54 transitions, 307 flow [2023-08-31 01:54:33,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 54 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-31 01:54:33,980 INFO L231 Difference]: Finished difference. Result has 30 places, 34 transitions, 205 flow [2023-08-31 01:54:33,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=30, PETRI_TRANSITIONS=34} [2023-08-31 01:54:33,981 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2023-08-31 01:54:33,981 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 205 flow [2023-08-31 01:54:33,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.25) internal successors, (1237), 4 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:33,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:33,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:33,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 01:54:33,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:33,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1716415558, now seen corresponding path program 2 times [2023-08-31 01:54:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748994183] [2023-08-31 01:54:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:34,164 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-31 01:54:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:34,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748994183] [2023-08-31 01:54:34,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748994183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:54:34,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:54:34,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:54:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280472996] [2023-08-31 01:54:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:34,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:54:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:34,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:54:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:54:34,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 759 [2023-08-31 01:54:34,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 311.25) internal successors, (1245), 4 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:34,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 759 [2023-08-31 01:54:34,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:34,361 INFO L130 PetriNetUnfolder]: 169/319 cut-off events. [2023-08-31 01:54:34,361 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2023-08-31 01:54:34,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 319 events. 169/319 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1234 event pairs, 67 based on Foata normal form. 16/335 useless extension candidates. Maximal degree in co-relation 612. Up to 122 conditions per place. [2023-08-31 01:54:34,363 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 55 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2023-08-31 01:54:34,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 66 transitions, 514 flow [2023-08-31 01:54:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1577 transitions. [2023-08-31 01:54:34,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4155467720685112 [2023-08-31 01:54:34,368 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1577 transitions. [2023-08-31 01:54:34,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1577 transitions. [2023-08-31 01:54:34,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:34,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1577 transitions. [2023-08-31 01:54:34,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,381 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 205 flow. Second operand 5 states and 1577 transitions. [2023-08-31 01:54:34,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 66 transitions, 514 flow [2023-08-31 01:54:34,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 502 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-31 01:54:34,389 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 278 flow [2023-08-31 01:54:34,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=37, PETRI_TRANSITIONS=39} [2023-08-31 01:54:34,391 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2023-08-31 01:54:34,394 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 278 flow [2023-08-31 01:54:34,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.25) internal successors, (1245), 4 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:34,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:34,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 01:54:34,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:34,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1708128844, now seen corresponding path program 1 times [2023-08-31 01:54:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946596353] [2023-08-31 01:54:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946596353] [2023-08-31 01:54:34,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946596353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:54:34,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:54:34,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 01:54:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133528226] [2023-08-31 01:54:34,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:34,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:54:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:34,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:54:34,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:54:34,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 759 [2023-08-31 01:54:34,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:34,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 759 [2023-08-31 01:54:34,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:34,707 INFO L130 PetriNetUnfolder]: 155/293 cut-off events. [2023-08-31 01:54:34,707 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-08-31 01:54:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 293 events. 155/293 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1124 event pairs, 16 based on Foata normal form. 6/299 useless extension candidates. Maximal degree in co-relation 758. Up to 134 conditions per place. [2023-08-31 01:54:34,710 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 20 changer transitions 6/65 dead transitions. [2023-08-31 01:54:34,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 551 flow [2023-08-31 01:54:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1569 transitions. [2023-08-31 01:54:34,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134387351778656 [2023-08-31 01:54:34,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1569 transitions. [2023-08-31 01:54:34,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1569 transitions. [2023-08-31 01:54:34,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:34,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1569 transitions. [2023-08-31 01:54:34,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.8) internal successors, (1569), 5 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,728 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 278 flow. Second operand 5 states and 1569 transitions. [2023-08-31 01:54:34,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 551 flow [2023-08-31 01:54:34,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 541 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-31 01:54:34,733 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 399 flow [2023-08-31 01:54:34,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-08-31 01:54:34,734 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2023-08-31 01:54:34,734 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 399 flow [2023-08-31 01:54:34,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:34,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 01:54:34,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:34,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1411080757, now seen corresponding path program 1 times [2023-08-31 01:54:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793328203] [2023-08-31 01:54:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:34,852 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-31 01:54:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793328203] [2023-08-31 01:54:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793328203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 01:54:34,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 01:54:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 01:54:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772544543] [2023-08-31 01:54:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:34,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 01:54:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 01:54:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 01:54:34,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 759 [2023-08-31 01:54:34,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:34,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:34,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 759 [2023-08-31 01:54:34,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:35,002 INFO L130 PetriNetUnfolder]: 94/176 cut-off events. [2023-08-31 01:54:35,003 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2023-08-31 01:54:35,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 176 events. 94/176 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 536 event pairs, 34 based on Foata normal form. 6/182 useless extension candidates. Maximal degree in co-relation 765. Up to 126 conditions per place. [2023-08-31 01:54:35,005 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 4 changer transitions 10/54 dead transitions. [2023-08-31 01:54:35,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 510 flow [2023-08-31 01:54:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1573 transitions. [2023-08-31 01:54:35,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4144927536231884 [2023-08-31 01:54:35,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1573 transitions. [2023-08-31 01:54:35,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1573 transitions. [2023-08-31 01:54:35,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:35,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1573 transitions. [2023-08-31 01:54:35,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.6) internal successors, (1573), 5 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,020 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 399 flow. Second operand 5 states and 1573 transitions. [2023-08-31 01:54:35,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 510 flow [2023-08-31 01:54:35,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 500 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-31 01:54:35,024 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 328 flow [2023-08-31 01:54:35,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-31 01:54:35,025 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2023-08-31 01:54:35,025 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 328 flow [2023-08-31 01:54:35,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:35,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:35,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 01:54:35,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:35,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1125366281, now seen corresponding path program 1 times [2023-08-31 01:54:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224350912] [2023-08-31 01:54:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:35,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:35,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224350912] [2023-08-31 01:54:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224350912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:54:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287458884] [2023-08-31 01:54:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:35,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:54:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:54:35,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:54:35,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 01:54:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:35,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 01:54:35,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:54:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:35,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:54:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287458884] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-31 01:54:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-31 01:54:35,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-08-31 01:54:35,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044545248] [2023-08-31 01:54:35,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 01:54:35,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 01:54:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:35,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 01:54:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-31 01:54:35,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 759 [2023-08-31 01:54:35,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:35,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 759 [2023-08-31 01:54:35,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:35,646 INFO L130 PetriNetUnfolder]: 100/169 cut-off events. [2023-08-31 01:54:35,646 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2023-08-31 01:54:35,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 169 events. 100/169 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 440 event pairs, 18 based on Foata normal form. 16/185 useless extension candidates. Maximal degree in co-relation 767. Up to 111 conditions per place. [2023-08-31 01:54:35,648 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-31 01:54:35,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 458 flow [2023-08-31 01:54:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 01:54:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 01:54:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1550 transitions. [2023-08-31 01:54:35,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40843214756258234 [2023-08-31 01:54:35,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1550 transitions. [2023-08-31 01:54:35,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1550 transitions. [2023-08-31 01:54:35,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:35,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1550 transitions. [2023-08-31 01:54:35,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,663 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 328 flow. Second operand 5 states and 1550 transitions. [2023-08-31 01:54:35,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 458 flow [2023-08-31 01:54:35,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 410 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-31 01:54:35,667 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 303 flow [2023-08-31 01:54:35,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-31 01:54:35,668 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2023-08-31 01:54:35,668 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 303 flow [2023-08-31 01:54:35,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:35,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:35,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:35,681 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-31 01:54:35,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-31 01:54:35,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:35,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash -4780107, now seen corresponding path program 1 times [2023-08-31 01:54:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:35,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916042619] [2023-08-31 01:54:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916042619] [2023-08-31 01:54:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916042619] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:54:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367334682] [2023-08-31 01:54:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:54:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:54:38,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:54:38,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 01:54:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:38,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-31 01:54:38,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:54:38,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 143 treesize of output 107 [2023-08-31 01:54:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:38,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:54:40,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:54:40,019 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 253 treesize of output 221 [2023-08-31 01:54:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:40,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367334682] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:54:40,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:54:40,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2023-08-31 01:54:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437692802] [2023-08-31 01:54:40,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:54:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 01:54:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 01:54:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-08-31 01:54:41,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 759 [2023-08-31 01:54:41,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 303 flow. Second operand has 20 states, 20 states have (on average 276.25) internal successors, (5525), 20 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:41,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:41,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 759 [2023-08-31 01:54:41,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:43,009 INFO L130 PetriNetUnfolder]: 272/472 cut-off events. [2023-08-31 01:54:43,009 INFO L131 PetriNetUnfolder]: For 1192/1192 co-relation queries the response was YES. [2023-08-31 01:54:43,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 472 events. 272/472 cut-off events. For 1192/1192 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1811 event pairs, 6 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 1728. Up to 181 conditions per place. [2023-08-31 01:54:43,013 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 104 selfloop transitions, 55 changer transitions 7/166 dead transitions. [2023-08-31 01:54:43,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 166 transitions, 1411 flow [2023-08-31 01:54:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-31 01:54:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-31 01:54:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5332 transitions. [2023-08-31 01:54:43,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36973857568823243 [2023-08-31 01:54:43,026 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5332 transitions. [2023-08-31 01:54:43,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5332 transitions. [2023-08-31 01:54:43,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:43,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5332 transitions. [2023-08-31 01:54:43,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 280.63157894736844) internal successors, (5332), 19 states have internal predecessors, (5332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:43,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:43,072 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:43,073 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 303 flow. Second operand 19 states and 5332 transitions. [2023-08-31 01:54:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 166 transitions, 1411 flow [2023-08-31 01:54:43,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 166 transitions, 1408 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 01:54:43,082 INFO L231 Difference]: Finished difference. Result has 71 places, 87 transitions, 943 flow [2023-08-31 01:54:43,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=943, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2023-08-31 01:54:43,083 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2023-08-31 01:54:43,083 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 943 flow [2023-08-31 01:54:43,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 276.25) internal successors, (5525), 20 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:43,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:43,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:43,095 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-31 01:54:43,295 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,SelfDestructingSolverStorable6 [2023-08-31 01:54:43,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:43,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1877271009, now seen corresponding path program 2 times [2023-08-31 01:54:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676022986] [2023-08-31 01:54:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676022986] [2023-08-31 01:54:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676022986] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:54:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910075462] [2023-08-31 01:54:44,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:54:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:54:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:54:44,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:54:44,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 01:54:45,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:54:45,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:54:45,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-31 01:54:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:54:45,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 137 treesize of output 101 [2023-08-31 01:54:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:45,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:54:46,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:54:46,517 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 253 treesize of output 221 [2023-08-31 01:54:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910075462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:54:46,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:54:46,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-31 01:54:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069681897] [2023-08-31 01:54:46,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:54:46,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:54:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:54:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-08-31 01:54:48,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 759 [2023-08-31 01:54:48,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 943 flow. Second operand has 21 states, 21 states have (on average 281.04761904761904) internal successors, (5902), 21 states have internal predecessors, (5902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:48,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:48,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 759 [2023-08-31 01:54:48,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:54:50,494 INFO L130 PetriNetUnfolder]: 647/1126 cut-off events. [2023-08-31 01:54:50,494 INFO L131 PetriNetUnfolder]: For 7759/7759 co-relation queries the response was YES. [2023-08-31 01:54:50,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1126 events. 647/1126 cut-off events. For 7759/7759 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5655 event pairs, 14 based on Foata normal form. 24/1150 useless extension candidates. Maximal degree in co-relation 5613. Up to 387 conditions per place. [2023-08-31 01:54:50,505 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 172 selfloop transitions, 212 changer transitions 17/401 dead transitions. [2023-08-31 01:54:50,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 401 transitions, 4549 flow [2023-08-31 01:54:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-31 01:54:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-31 01:54:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 13122 transitions. [2023-08-31 01:54:50,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37583777281319813 [2023-08-31 01:54:50,539 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 13122 transitions. [2023-08-31 01:54:50,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 13122 transitions. [2023-08-31 01:54:50,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:54:50,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 13122 transitions. [2023-08-31 01:54:50,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 285.2608695652174) internal successors, (13122), 46 states have internal predecessors, (13122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:50,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:50,647 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:50,647 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 943 flow. Second operand 46 states and 13122 transitions. [2023-08-31 01:54:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 401 transitions, 4549 flow [2023-08-31 01:54:50,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 401 transitions, 4260 flow, removed 139 selfloop flow, removed 3 redundant places. [2023-08-31 01:54:50,689 INFO L231 Difference]: Finished difference. Result has 125 places, 253 transitions, 3493 flow [2023-08-31 01:54:50,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3493, PETRI_PLACES=125, PETRI_TRANSITIONS=253} [2023-08-31 01:54:50,691 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2023-08-31 01:54:50,692 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 253 transitions, 3493 flow [2023-08-31 01:54:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 281.04761904761904) internal successors, (5902), 21 states have internal predecessors, (5902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:50,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:54:50,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:54:50,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 01:54:50,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:54:50,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:54:50,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:54:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1904976639, now seen corresponding path program 3 times [2023-08-31 01:54:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:54:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210320161] [2023-08-31 01:54:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:54:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:54:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:54:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:52,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:54:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210320161] [2023-08-31 01:54:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210320161] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:54:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710325148] [2023-08-31 01:54:52,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:54:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:54:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:54:52,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:54:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 01:54:52,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 01:54:52,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:54:52,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-31 01:54:52,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:54:52,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 01:54:52,696 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 6 treesize of output 5 [2023-08-31 01:54:52,749 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 6 treesize of output 5 [2023-08-31 01:54:53,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 143 treesize of output 107 [2023-08-31 01:54:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:54:53,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:54:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:54:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710325148] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:54:54,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:54:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2023-08-31 01:54:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271209580] [2023-08-31 01:54:54,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:54:54,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:54:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:54:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:54:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=326, Unknown=4, NotChecked=0, Total=420 [2023-08-31 01:54:55,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-08-31 01:54:55,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 253 transitions, 3493 flow. Second operand has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:54:55,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:54:55,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-08-31 01:54:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:55:10,243 WARN L222 SmtUtils]: Spent 14.36s on a formula simplification. DAG size of input: 84 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:55:10,442 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base)) (.cse15 (+ c_~A~0.offset (* c_~j~0 4)))) (let ((.cse24 (select .cse8 .cse15)) (.cse23 (+ c_~bag1~0 c_~sum1~0))) (let ((.cse2 (< 2147483647 .cse23)) (.cse3 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse9 (+ c_~A~0.offset (* c_~i~0 4))) (.cse0 (< (+ c_~bag2~0 .cse24 2147483648) 0)) (.cse1 (< 2147483647 (+ c_~bag2~0 .cse24))) (.cse10 (<= c_~N~0 c_~j~0)) (.cse6 (+ c_~bag2~0 .cse24 c_~sum2~0)) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse0 .cse1 (let ((.cse5 (select .cse8 .cse9))) (let ((.cse4 (let ((.cse7 (+ c_~bag1~0 c_~sum1~0 .cse5))) (and (<= .cse6 .cse7) (<= .cse7 .cse6))))) (and (or .cse2 .cse3 .cse4) (or (< 2147483647 (+ c_~bag1~0 .cse5)) .cse4 (< (+ c_~bag1~0 .cse5 2147483648) 0))))) .cse10) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum1~0 2147483647) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 2147483648)) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse15)) (.cse12 (select .cse14 .cse9))) (or (< (+ c_~bag1~0 .cse12 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13)) (<= (+ c_~bag1~0 c_~sum1~0 .cse12) (+ c_~bag2~0 c_~sum2~0 .cse13)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse12)))))) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse16)) (<= (+ c_~bag2~0 c_~sum2~0 .cse16) (+ c_~bag1~0 c_~sum1~0 (select .cse17 .cse9))) (< (+ c_~bag2~0 .cse16 2147483648) 0))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse18)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse9)) (+ c_~bag2~0 c_~sum2~0 .cse18)) (< (+ c_~bag2~0 .cse18 2147483648) 0)))))) .cse2 .cse3) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse15)) (.cse20 (select .cse22 .cse9))) (or (< (+ c_~bag1~0 .cse20 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse21)) (<= (+ c_~bag2~0 c_~sum2~0 .cse21) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< (+ c_~bag2~0 .cse21 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse20))))))) .cse10) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse0 .cse1 .cse10 (and (<= .cse6 .cse23) (<= .cse23 .cse6))) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|))))) is different from false [2023-08-31 01:55:12,440 INFO L130 PetriNetUnfolder]: 824/1490 cut-off events. [2023-08-31 01:55:12,440 INFO L131 PetriNetUnfolder]: For 14285/14285 co-relation queries the response was YES. [2023-08-31 01:55:12,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 1490 events. 824/1490 cut-off events. For 14285/14285 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8246 event pairs, 33 based on Foata normal form. 4/1494 useless extension candidates. Maximal degree in co-relation 9552. Up to 506 conditions per place. [2023-08-31 01:55:12,458 INFO L137 encePairwiseOnDemand]: 745/759 looper letters, 223 selfloop transitions, 186 changer transitions 11/420 dead transitions. [2023-08-31 01:55:12,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 420 transitions, 6158 flow [2023-08-31 01:55:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-31 01:55:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-31 01:55:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6984 transitions. [2023-08-31 01:55:12,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3286278938452851 [2023-08-31 01:55:12,469 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6984 transitions. [2023-08-31 01:55:12,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6984 transitions. [2023-08-31 01:55:12,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:55:12,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6984 transitions. [2023-08-31 01:55:12,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 249.42857142857142) internal successors, (6984), 28 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:12,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:12,511 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:12,511 INFO L175 Difference]: Start difference. First operand has 125 places, 253 transitions, 3493 flow. Second operand 28 states and 6984 transitions. [2023-08-31 01:55:12,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 420 transitions, 6158 flow [2023-08-31 01:55:12,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 420 transitions, 4895 flow, removed 595 selfloop flow, removed 9 redundant places. [2023-08-31 01:55:12,623 INFO L231 Difference]: Finished difference. Result has 158 places, 321 transitions, 4060 flow [2023-08-31 01:55:12,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4060, PETRI_PLACES=158, PETRI_TRANSITIONS=321} [2023-08-31 01:55:12,624 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2023-08-31 01:55:12,624 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 321 transitions, 4060 flow [2023-08-31 01:55:12,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:12,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:55:12,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:55:12,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-31 01:55:12,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:12,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:55:12,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:55:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -927665921, now seen corresponding path program 4 times [2023-08-31 01:55:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:55:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654340277] [2023-08-31 01:55:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:55:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:55:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:55:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654340277] [2023-08-31 01:55:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654340277] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:55:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774396682] [2023-08-31 01:55:14,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:55:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:55:14,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:55:14,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 01:55:14,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:55:14,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:55:14,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-31 01:55:14,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:55:14,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 137 treesize of output 101 [2023-08-31 01:55:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:15,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:55:15,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:55:15,930 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 253 treesize of output 221 [2023-08-31 01:55:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:55:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774396682] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:55:16,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:55:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2023-08-31 01:55:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268232964] [2023-08-31 01:55:16,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:55:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 01:55:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:55:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 01:55:16,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-08-31 01:55:18,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 759 [2023-08-31 01:55:18,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 321 transitions, 4060 flow. Second operand has 23 states, 23 states have (on average 275.8695652173913) internal successors, (6345), 23 states have internal predecessors, (6345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:18,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:55:18,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 759 [2023-08-31 01:55:18,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:55:21,450 INFO L130 PetriNetUnfolder]: 765/1390 cut-off events. [2023-08-31 01:55:21,451 INFO L131 PetriNetUnfolder]: For 9688/9688 co-relation queries the response was YES. [2023-08-31 01:55:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8966 conditions, 1390 events. 765/1390 cut-off events. For 9688/9688 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7367 event pairs, 9 based on Foata normal form. 14/1404 useless extension candidates. Maximal degree in co-relation 8833. Up to 368 conditions per place. [2023-08-31 01:55:21,468 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 139 selfloop transitions, 322 changer transitions 16/477 dead transitions. [2023-08-31 01:55:21,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 477 transitions, 6110 flow [2023-08-31 01:55:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-31 01:55:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-31 01:55:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 13686 transitions. [2023-08-31 01:55:21,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36799225619101394 [2023-08-31 01:55:21,486 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 13686 transitions. [2023-08-31 01:55:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 13686 transitions. [2023-08-31 01:55:21,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:55:21,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 13686 transitions. [2023-08-31 01:55:21,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 279.3061224489796) internal successors, (13686), 49 states have internal predecessors, (13686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:21,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:21,540 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:21,540 INFO L175 Difference]: Start difference. First operand has 158 places, 321 transitions, 4060 flow. Second operand 49 states and 13686 transitions. [2023-08-31 01:55:21,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 477 transitions, 6110 flow [2023-08-31 01:55:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 477 transitions, 5786 flow, removed 82 selfloop flow, removed 21 redundant places. [2023-08-31 01:55:21,679 INFO L231 Difference]: Finished difference. Result has 181 places, 360 transitions, 5031 flow [2023-08-31 01:55:21,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5031, PETRI_PLACES=181, PETRI_TRANSITIONS=360} [2023-08-31 01:55:21,681 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 161 predicate places. [2023-08-31 01:55:21,681 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 360 transitions, 5031 flow [2023-08-31 01:55:21,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 275.8695652173913) internal successors, (6345), 23 states have internal predecessors, (6345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:21,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:55:21,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:55:21,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-31 01:55:21,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-31 01:55:21,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:55:21,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:55:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1874892425, now seen corresponding path program 5 times [2023-08-31 01:55:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:55:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037616429] [2023-08-31 01:55:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:55:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:55:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:55:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037616429] [2023-08-31 01:55:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037616429] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:55:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478893265] [2023-08-31 01:55:23,314 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:55:23,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:23,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:55:23,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:55:23,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-31 01:55:23,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 01:55:23,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:55:23,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-31 01:55:23,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:55:23,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 123 treesize of output 103 [2023-08-31 01:55:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:23,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:55:24,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:55:24,548 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 339 treesize of output 251 [2023-08-31 01:55:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:55:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478893265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:55:24,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:55:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-31 01:55:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353631448] [2023-08-31 01:55:24,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:55:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 01:55:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:55:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 01:55:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-08-31 01:55:26,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 759 [2023-08-31 01:55:26,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 360 transitions, 5031 flow. Second operand has 21 states, 21 states have (on average 281.04761904761904) internal successors, (5902), 21 states have internal predecessors, (5902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:26,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:55:26,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 759 [2023-08-31 01:55:26,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:55:27,730 INFO L130 PetriNetUnfolder]: 747/1400 cut-off events. [2023-08-31 01:55:27,730 INFO L131 PetriNetUnfolder]: For 9064/9064 co-relation queries the response was YES. [2023-08-31 01:55:27,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 1400 events. 747/1400 cut-off events. For 9064/9064 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7661 event pairs, 10 based on Foata normal form. 12/1412 useless extension candidates. Maximal degree in co-relation 9549. Up to 377 conditions per place. [2023-08-31 01:55:27,766 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 174 selfloop transitions, 255 changer transitions 12/441 dead transitions. [2023-08-31 01:55:27,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 441 transitions, 6447 flow [2023-08-31 01:55:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-31 01:55:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-31 01:55:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 7695 transitions. [2023-08-31 01:55:27,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37549407114624506 [2023-08-31 01:55:27,777 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 7695 transitions. [2023-08-31 01:55:27,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 7695 transitions. [2023-08-31 01:55:27,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:55:27,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 7695 transitions. [2023-08-31 01:55:27,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 285.0) internal successors, (7695), 27 states have internal predecessors, (7695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:27,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:27,804 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:27,805 INFO L175 Difference]: Start difference. First operand has 181 places, 360 transitions, 5031 flow. Second operand 27 states and 7695 transitions. [2023-08-31 01:55:27,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 441 transitions, 6447 flow [2023-08-31 01:55:27,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 441 transitions, 5743 flow, removed 260 selfloop flow, removed 28 redundant places. [2023-08-31 01:55:27,902 INFO L231 Difference]: Finished difference. Result has 183 places, 368 transitions, 5243 flow [2023-08-31 01:55:27,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4089, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5243, PETRI_PLACES=183, PETRI_TRANSITIONS=368} [2023-08-31 01:55:27,903 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 163 predicate places. [2023-08-31 01:55:27,903 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 368 transitions, 5243 flow [2023-08-31 01:55:27,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 281.04761904761904) internal successors, (5902), 21 states have internal predecessors, (5902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:27,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:55:27,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:55:27,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-31 01:55:28,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:28,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:55:28,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:55:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1562389633, now seen corresponding path program 6 times [2023-08-31 01:55:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:55:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027165487] [2023-08-31 01:55:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:55:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:55:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:55:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027165487] [2023-08-31 01:55:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027165487] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:55:29,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493323243] [2023-08-31 01:55:29,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 01:55:29,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:29,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:55:29,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:55:29,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-31 01:55:29,570 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-31 01:55:29,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:55:29,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjunts are in the unsatisfiable core [2023-08-31 01:55:29,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:55:29,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 01:55:29,682 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 6 treesize of output 5 [2023-08-31 01:55:29,739 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 6 treesize of output 5 [2023-08-31 01:55:29,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 123 treesize of output 103 [2023-08-31 01:55:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:30,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:55:31,252 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (<= (+ 2 c_~i~0) c_~N~0)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse1)) (< (+ c_~bag2~0 .cse1 2147483648) 0) (= (+ (select .cse2 .cse3) c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse1 c_~sum2~0)))))) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (or .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse3)) (.cse6 (select .cse7 .cse4))) (or (< 2147483647 (+ .cse5 c_~bag1~0)) (< (+ .cse5 c_~bag1~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse6)) (< (+ c_~bag2~0 .cse6 2147483648) 0) (= (+ .cse5 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse6 c_~sum2~0))))))))) (<= c_~N~0 c_~j~0)) is different from false [2023-08-31 01:55:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:55:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493323243] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:55:31,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:55:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-08-31 01:55:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725988145] [2023-08-31 01:55:31,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:55:31,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 01:55:31,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:55:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 01:55:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=383, Unknown=1, NotChecked=40, Total=506 [2023-08-31 01:55:31,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-08-31 01:55:31,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 368 transitions, 5243 flow. Second operand has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:31,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:55:31,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-08-31 01:55:31,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:55:33,301 INFO L130 PetriNetUnfolder]: 709/1330 cut-off events. [2023-08-31 01:55:33,301 INFO L131 PetriNetUnfolder]: For 6999/6999 co-relation queries the response was YES. [2023-08-31 01:55:33,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 1330 events. 709/1330 cut-off events. For 6999/6999 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7208 event pairs, 23 based on Foata normal form. 6/1336 useless extension candidates. Maximal degree in co-relation 8878. Up to 477 conditions per place. [2023-08-31 01:55:33,315 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 142 selfloop transitions, 260 changer transitions 11/413 dead transitions. [2023-08-31 01:55:33,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 413 transitions, 6116 flow [2023-08-31 01:55:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-31 01:55:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-31 01:55:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6456 transitions. [2023-08-31 01:55:33,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32715110975980544 [2023-08-31 01:55:33,322 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6456 transitions. [2023-08-31 01:55:33,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6456 transitions. [2023-08-31 01:55:33,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:55:33,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6456 transitions. [2023-08-31 01:55:33,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 248.30769230769232) internal successors, (6456), 26 states have internal predecessors, (6456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:33,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:33,344 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:33,345 INFO L175 Difference]: Start difference. First operand has 183 places, 368 transitions, 5243 flow. Second operand 26 states and 6456 transitions. [2023-08-31 01:55:33,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 413 transitions, 6116 flow [2023-08-31 01:55:33,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 413 transitions, 5954 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-08-31 01:55:33,433 INFO L231 Difference]: Finished difference. Result has 197 places, 360 transitions, 5485 flow [2023-08-31 01:55:33,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5485, PETRI_PLACES=197, PETRI_TRANSITIONS=360} [2023-08-31 01:55:33,434 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 177 predicate places. [2023-08-31 01:55:33,434 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 360 transitions, 5485 flow [2023-08-31 01:55:33,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:33,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:55:33,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:55:33,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 01:55:33,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:33,637 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:55:33,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:55:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1901055643, now seen corresponding path program 7 times [2023-08-31 01:55:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:55:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709459195] [2023-08-31 01:55:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:55:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:55:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:55:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709459195] [2023-08-31 01:55:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709459195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:55:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569339698] [2023-08-31 01:55:34,697 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 01:55:34,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:34,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:55:34,698 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-31 01:55:34,701 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-31 01:55:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:34,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-31 01:55:34,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:55:35,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 123 treesize of output 103 [2023-08-31 01:55:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:55:35,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:55:35,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:55:35,847 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 339 treesize of output 251 [2023-08-31 01:55:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:55:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569339698] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:55:36,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:55:36,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-08-31 01:55:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471346727] [2023-08-31 01:55:36,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:55:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-31 01:55:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:55:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-31 01:55:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-08-31 01:55:37,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 759 [2023-08-31 01:55:37,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 360 transitions, 5485 flow. Second operand has 19 states, 19 states have (on average 280.2105263157895) internal successors, (5324), 19 states have internal predecessors, (5324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:37,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:55:37,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 759 [2023-08-31 01:55:37,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:55:38,124 INFO L130 PetriNetUnfolder]: 712/1329 cut-off events. [2023-08-31 01:55:38,124 INFO L131 PetriNetUnfolder]: For 7286/7286 co-relation queries the response was YES. [2023-08-31 01:55:38,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 1329 events. 712/1329 cut-off events. For 7286/7286 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7191 event pairs, 41 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 9549. Up to 778 conditions per place. [2023-08-31 01:55:38,137 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 302 selfloop transitions, 87 changer transitions 8/397 dead transitions. [2023-08-31 01:55:38,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 397 transitions, 6460 flow [2023-08-31 01:55:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 01:55:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 01:55:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4832 transitions. [2023-08-31 01:55:38,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3744865535146865 [2023-08-31 01:55:38,145 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4832 transitions. [2023-08-31 01:55:38,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4832 transitions. [2023-08-31 01:55:38,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:55:38,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4832 transitions. [2023-08-31 01:55:38,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 284.2352941176471) internal successors, (4832), 17 states have internal predecessors, (4832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:38,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:38,162 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:38,163 INFO L175 Difference]: Start difference. First operand has 197 places, 360 transitions, 5485 flow. Second operand 17 states and 4832 transitions. [2023-08-31 01:55:38,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 397 transitions, 6460 flow [2023-08-31 01:55:38,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 397 transitions, 6393 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-31 01:55:38,250 INFO L231 Difference]: Finished difference. Result has 205 places, 360 transitions, 5641 flow [2023-08-31 01:55:38,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5422, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5641, PETRI_PLACES=205, PETRI_TRANSITIONS=360} [2023-08-31 01:55:38,251 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 185 predicate places. [2023-08-31 01:55:38,251 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 360 transitions, 5641 flow [2023-08-31 01:55:38,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 280.2105263157895) internal successors, (5324), 19 states have internal predecessors, (5324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:55:38,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:55:38,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:55:38,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-31 01:55:38,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-31 01:55:38,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:55:38,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:55:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1100080267, now seen corresponding path program 8 times [2023-08-31 01:55:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:55:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713567411] [2023-08-31 01:55:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:55:38,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:55:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:55:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:39,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:55:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713567411] [2023-08-31 01:55:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713567411] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:55:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877690621] [2023-08-31 01:55:39,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:55:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:55:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:55:39,427 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:55:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 01:55:39,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:55:39,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:55:39,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-31 01:55:39,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:55:39,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 01:55:39,589 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 6 treesize of output 5 [2023-08-31 01:55:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:55:39,737 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-31 01:55:39,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 137 treesize of output 101 [2023-08-31 01:55:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:39,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:55:41,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:55:41,075 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 97 treesize of output 61 [2023-08-31 01:55:41,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 228 treesize of output 204 [2023-08-31 01:55:41,091 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 69 treesize of output 63 [2023-08-31 01:55:41,100 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 128 treesize of output 116 [2023-08-31 01:55:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:55:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877690621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:55:41,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:55:41,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-08-31 01:55:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180132403] [2023-08-31 01:55:41,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:55:41,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-31 01:55:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:55:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-31 01:55:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=506, Unknown=2, NotChecked=0, Total=600 [2023-08-31 01:55:43,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:45,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:47,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:49,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:51,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:53,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:55,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:57,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:55:59,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:01,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:03,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:07,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:09,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:11,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:14,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:16,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:18,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:20,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:22,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:24,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:26,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:28,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:30,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:32,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:34,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:36,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:38,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:40,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:42,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:44,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:46,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:48,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:50,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 01:56:50,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-08-31 01:56:50,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 360 transitions, 5641 flow. Second operand has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:50,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:56:50,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-08-31 01:56:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:56:52,717 INFO L130 PetriNetUnfolder]: 751/1412 cut-off events. [2023-08-31 01:56:52,718 INFO L131 PetriNetUnfolder]: For 8009/8009 co-relation queries the response was YES. [2023-08-31 01:56:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10450 conditions, 1412 events. 751/1412 cut-off events. For 8009/8009 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7867 event pairs, 21 based on Foata normal form. 2/1414 useless extension candidates. Maximal degree in co-relation 10326. Up to 483 conditions per place. [2023-08-31 01:56:52,730 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 222 selfloop transitions, 208 changer transitions 8/438 dead transitions. [2023-08-31 01:56:52,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 438 transitions, 7142 flow [2023-08-31 01:56:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 01:56:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 01:56:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5734 transitions. [2023-08-31 01:56:52,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284642263848313 [2023-08-31 01:56:52,737 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5734 transitions. [2023-08-31 01:56:52,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5734 transitions. [2023-08-31 01:56:52,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:56:52,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5734 transitions. [2023-08-31 01:56:52,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 249.30434782608697) internal successors, (5734), 23 states have internal predecessors, (5734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:52,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:52,756 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:52,756 INFO L175 Difference]: Start difference. First operand has 205 places, 360 transitions, 5641 flow. Second operand 23 states and 5734 transitions. [2023-08-31 01:56:52,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 438 transitions, 7142 flow [2023-08-31 01:56:52,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 438 transitions, 6900 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-08-31 01:56:52,832 INFO L231 Difference]: Finished difference. Result has 215 places, 379 transitions, 6199 flow [2023-08-31 01:56:52,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5413, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6199, PETRI_PLACES=215, PETRI_TRANSITIONS=379} [2023-08-31 01:56:52,833 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 195 predicate places. [2023-08-31 01:56:52,833 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 379 transitions, 6199 flow [2023-08-31 01:56:52,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:52,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:56:52,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:56:52,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 01:56:53,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-31 01:56:53,035 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:56:53,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:56:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 761414257, now seen corresponding path program 9 times [2023-08-31 01:56:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:56:53,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265126947] [2023-08-31 01:56:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:56:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:56:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:56:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:56:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:56:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265126947] [2023-08-31 01:56:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265126947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:56:54,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68165683] [2023-08-31 01:56:54,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 01:56:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:56:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:56:54,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:56:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 01:56:54,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-31 01:56:54,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:56:54,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-31 01:56:54,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:56:54,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:56:54,676 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-31 01:56:54,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 137 treesize of output 101 [2023-08-31 01:56:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:56:54,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:56:55,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:56:55,644 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 317 treesize of output 285 [2023-08-31 01:56:55,662 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 50 treesize of output 32 [2023-08-31 01:56:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:56:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68165683] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:56:56,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:56:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-08-31 01:56:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987631334] [2023-08-31 01:56:56,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:56:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 01:56:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:56:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 01:56:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=535, Unknown=1, NotChecked=0, Total=650 [2023-08-31 01:56:56,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 759 [2023-08-31 01:56:56,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 379 transitions, 6199 flow. Second operand has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:56:56,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:56:56,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 759 [2023-08-31 01:56:56,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:57:46,929 WARN L222 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:58:01,347 WARN L222 SmtUtils]: Spent 14.22s on a formula simplification. DAG size of input: 61 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:58:07,606 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 79 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 01:58:14,261 INFO L130 PetriNetUnfolder]: 851/1609 cut-off events. [2023-08-31 01:58:14,261 INFO L131 PetriNetUnfolder]: For 10811/10811 co-relation queries the response was YES. [2023-08-31 01:58:14,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12261 conditions, 1609 events. 851/1609 cut-off events. For 10811/10811 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9208 event pairs, 5 based on Foata normal form. 3/1612 useless extension candidates. Maximal degree in co-relation 12145. Up to 507 conditions per place. [2023-08-31 01:58:14,276 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 175 selfloop transitions, 366 changer transitions 10/551 dead transitions. [2023-08-31 01:58:14,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 551 transitions, 8782 flow [2023-08-31 01:58:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-31 01:58:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-31 01:58:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 14288 transitions. [2023-08-31 01:58:14,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302591128678085 [2023-08-31 01:58:14,290 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 14288 transitions. [2023-08-31 01:58:14,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 14288 transitions. [2023-08-31 01:58:14,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:14,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 14288 transitions. [2023-08-31 01:58:14,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 250.66666666666666) internal successors, (14288), 57 states have internal predecessors, (14288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:14,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:14,340 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:14,340 INFO L175 Difference]: Start difference. First operand has 215 places, 379 transitions, 6199 flow. Second operand 57 states and 14288 transitions. [2023-08-31 01:58:14,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 551 transitions, 8782 flow [2023-08-31 01:58:14,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 551 transitions, 8656 flow, removed 10 selfloop flow, removed 14 redundant places. [2023-08-31 01:58:14,469 INFO L231 Difference]: Finished difference. Result has 264 places, 438 transitions, 7875 flow [2023-08-31 01:58:14,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6085, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=7875, PETRI_PLACES=264, PETRI_TRANSITIONS=438} [2023-08-31 01:58:14,470 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 244 predicate places. [2023-08-31 01:58:14,470 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 438 transitions, 7875 flow [2023-08-31 01:58:14,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:14,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:14,471 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:14,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 01:58:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-31 01:58:14,672 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:58:14,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 681692873, now seen corresponding path program 10 times [2023-08-31 01:58:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133531197] [2023-08-31 01:58:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133531197] [2023-08-31 01:58:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133531197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583294608] [2023-08-31 01:58:14,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 01:58:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:14,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:14,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 01:58:14,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 01:58:14,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:58:14,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 01:58:14,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:15,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:15,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 209 treesize of output 193 [2023-08-31 01:58:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583294608] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:58:15,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:58:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-31 01:58:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250683071] [2023-08-31 01:58:15,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:58:15,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 01:58:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:58:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 01:58:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-08-31 01:58:15,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 759 [2023-08-31 01:58:15,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 438 transitions, 7875 flow. Second operand has 15 states, 15 states have (on average 296.8666666666667) internal successors, (4453), 15 states have internal predecessors, (4453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:15,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:58:15,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 759 [2023-08-31 01:58:15,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:58:16,197 INFO L130 PetriNetUnfolder]: 772/1470 cut-off events. [2023-08-31 01:58:16,197 INFO L131 PetriNetUnfolder]: For 11125/11125 co-relation queries the response was YES. [2023-08-31 01:58:16,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11781 conditions, 1470 events. 772/1470 cut-off events. For 11125/11125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8265 event pairs, 127 based on Foata normal form. 79/1549 useless extension candidates. Maximal degree in co-relation 11724. Up to 668 conditions per place. [2023-08-31 01:58:16,207 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 231 selfloop transitions, 211 changer transitions 0/442 dead transitions. [2023-08-31 01:58:16,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 442 transitions, 8116 flow [2023-08-31 01:58:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 01:58:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 01:58:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5095 transitions. [2023-08-31 01:58:16,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39486941021467875 [2023-08-31 01:58:16,212 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5095 transitions. [2023-08-31 01:58:16,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5095 transitions. [2023-08-31 01:58:16,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:16,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5095 transitions. [2023-08-31 01:58:16,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 299.70588235294116) internal successors, (5095), 17 states have internal predecessors, (5095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:16,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:16,226 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:16,226 INFO L175 Difference]: Start difference. First operand has 264 places, 438 transitions, 7875 flow. Second operand 17 states and 5095 transitions. [2023-08-31 01:58:16,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 442 transitions, 8116 flow [2023-08-31 01:58:16,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 442 transitions, 7513 flow, removed 97 selfloop flow, removed 31 redundant places. [2023-08-31 01:58:16,316 INFO L231 Difference]: Finished difference. Result has 237 places, 396 transitions, 6806 flow [2023-08-31 01:58:16,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6003, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6806, PETRI_PLACES=237, PETRI_TRANSITIONS=396} [2023-08-31 01:58:16,317 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 217 predicate places. [2023-08-31 01:58:16,317 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 396 transitions, 6806 flow [2023-08-31 01:58:16,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.8666666666667) internal successors, (4453), 15 states have internal predecessors, (4453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:16,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:16,318 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:16,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 01:58:16,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-31 01:58:16,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:58:16,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1250955687, now seen corresponding path program 11 times [2023-08-31 01:58:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417533780] [2023-08-31 01:58:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417533780] [2023-08-31 01:58:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417533780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154359363] [2023-08-31 01:58:16,671 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 01:58:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:16,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:16,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-31 01:58:16,778 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:58:16,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:58:16,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-31 01:58:16,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:16,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:17,261 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 01:58:17,262 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 353 treesize of output 249 [2023-08-31 01:58:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154359363] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:58:17,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:58:17,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-31 01:58:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059672373] [2023-08-31 01:58:17,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:58:17,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:58:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:58:17,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:58:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-08-31 01:58:17,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 759 [2023-08-31 01:58:17,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 396 transitions, 6806 flow. Second operand has 13 states, 13 states have (on average 292.7692307692308) internal successors, (3806), 13 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:17,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:58:17,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 759 [2023-08-31 01:58:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:58:18,046 INFO L130 PetriNetUnfolder]: 526/1076 cut-off events. [2023-08-31 01:58:18,047 INFO L131 PetriNetUnfolder]: For 6646/6646 co-relation queries the response was YES. [2023-08-31 01:58:18,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 1076 events. 526/1076 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5896 event pairs, 97 based on Foata normal form. 82/1158 useless extension candidates. Maximal degree in co-relation 8541. Up to 409 conditions per place. [2023-08-31 01:58:18,055 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 260 selfloop transitions, 49 changer transitions 19/328 dead transitions. [2023-08-31 01:58:18,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 328 transitions, 6155 flow [2023-08-31 01:58:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 01:58:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 01:58:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2371 transitions. [2023-08-31 01:58:18,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3904808959156785 [2023-08-31 01:58:18,064 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2371 transitions. [2023-08-31 01:58:18,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2371 transitions. [2023-08-31 01:58:18,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:18,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2371 transitions. [2023-08-31 01:58:18,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 296.375) internal successors, (2371), 8 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:18,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:18,070 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:18,070 INFO L175 Difference]: Start difference. First operand has 237 places, 396 transitions, 6806 flow. Second operand 8 states and 2371 transitions. [2023-08-31 01:58:18,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 328 transitions, 6155 flow [2023-08-31 01:58:18,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 328 transitions, 5838 flow, removed 26 selfloop flow, removed 18 redundant places. [2023-08-31 01:58:18,143 INFO L231 Difference]: Finished difference. Result has 224 places, 295 transitions, 5022 flow [2023-08-31 01:58:18,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5125, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5022, PETRI_PLACES=224, PETRI_TRANSITIONS=295} [2023-08-31 01:58:18,144 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 204 predicate places. [2023-08-31 01:58:18,144 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 295 transitions, 5022 flow [2023-08-31 01:58:18,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 292.7692307692308) internal successors, (3806), 13 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:18,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:18,145 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:18,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-31 01:58:18,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-31 01:58:18,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:58:18,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 265595398, now seen corresponding path program 12 times [2023-08-31 01:58:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130742732] [2023-08-31 01:58:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130742732] [2023-08-31 01:58:18,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130742732] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520621863] [2023-08-31 01:58:18,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 01:58:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:18,493 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:18,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-31 01:58:18,630 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-31 01:58:18,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:58:18,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 01:58:18,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:18,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:19,598 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 01:58:19,599 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 237 treesize of output 205 [2023-08-31 01:58:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520621863] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:58:19,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:58:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2023-08-31 01:58:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906101210] [2023-08-31 01:58:19,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:58:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-31 01:58:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:58:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-31 01:58:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-31 01:58:20,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 759 [2023-08-31 01:58:20,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 295 transitions, 5022 flow. Second operand has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:20,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:58:20,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 759 [2023-08-31 01:58:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:58:20,517 INFO L130 PetriNetUnfolder]: 376/729 cut-off events. [2023-08-31 01:58:20,518 INFO L131 PetriNetUnfolder]: For 5282/5282 co-relation queries the response was YES. [2023-08-31 01:58:20,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 729 events. 376/729 cut-off events. For 5282/5282 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3314 event pairs, 16 based on Foata normal form. 19/748 useless extension candidates. Maximal degree in co-relation 5556. Up to 250 conditions per place. [2023-08-31 01:58:20,522 INFO L137 encePairwiseOnDemand]: 750/759 looper letters, 131 selfloop transitions, 91 changer transitions 29/251 dead transitions. [2023-08-31 01:58:20,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 4085 flow [2023-08-31 01:58:20,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 01:58:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 01:58:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4906 transitions. [2023-08-31 01:58:20,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38022165387894286 [2023-08-31 01:58:20,533 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4906 transitions. [2023-08-31 01:58:20,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4906 transitions. [2023-08-31 01:58:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:20,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4906 transitions. [2023-08-31 01:58:20,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 288.5882352941176) internal successors, (4906), 17 states have internal predecessors, (4906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:20,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:20,545 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:20,546 INFO L175 Difference]: Start difference. First operand has 224 places, 295 transitions, 5022 flow. Second operand 17 states and 4906 transitions. [2023-08-31 01:58:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 4085 flow [2023-08-31 01:58:20,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 251 transitions, 3835 flow, removed 9 selfloop flow, removed 27 redundant places. [2023-08-31 01:58:20,581 INFO L231 Difference]: Finished difference. Result has 171 places, 188 transitions, 3133 flow [2023-08-31 01:58:20,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3133, PETRI_PLACES=171, PETRI_TRANSITIONS=188} [2023-08-31 01:58:20,581 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2023-08-31 01:58:20,581 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 188 transitions, 3133 flow [2023-08-31 01:58:20,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 286.0) internal successors, (3718), 13 states have internal predecessors, (3718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:20,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:20,582 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:20,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-31 01:58:20,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 01:58:20,783 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:58:20,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1735114768, now seen corresponding path program 13 times [2023-08-31 01:58:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220462200] [2023-08-31 01:58:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:24,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220462200] [2023-08-31 01:58:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220462200] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235092632] [2023-08-31 01:58:24,249 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 01:58:24,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:24,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:24,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:24,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-31 01:58:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:24,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-31 01:58:24,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:25,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:58:25,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 160 [2023-08-31 01:58:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-31 01:58:25,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:28,411 INFO L321 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-08-31 01:58:28,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1173 treesize of output 585 [2023-08-31 01:58:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 01:58:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235092632] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:58:39,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:58:39,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2023-08-31 01:58:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748415439] [2023-08-31 01:58:39,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:58:39,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 01:58:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:58:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 01:58:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-08-31 01:58:41,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 759 [2023-08-31 01:58:41,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 188 transitions, 3133 flow. Second operand has 26 states, 26 states have (on average 274.11538461538464) internal successors, (7127), 26 states have internal predecessors, (7127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:41,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:58:41,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 759 [2023-08-31 01:58:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 01:58:43,471 INFO L130 PetriNetUnfolder]: 527/937 cut-off events. [2023-08-31 01:58:43,471 INFO L131 PetriNetUnfolder]: For 9133/9133 co-relation queries the response was YES. [2023-08-31 01:58:43,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 937 events. 527/937 cut-off events. For 9133/9133 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4348 event pairs, 18 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 7711. Up to 527 conditions per place. [2023-08-31 01:58:43,480 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 171 selfloop transitions, 132 changer transitions 8/311 dead transitions. [2023-08-31 01:58:43,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 311 transitions, 5336 flow [2023-08-31 01:58:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-31 01:58:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-31 01:58:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6374 transitions. [2023-08-31 01:58:43,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3651257375264937 [2023-08-31 01:58:43,488 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 6374 transitions. [2023-08-31 01:58:43,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 6374 transitions. [2023-08-31 01:58:43,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 01:58:43,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 6374 transitions. [2023-08-31 01:58:43,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 277.1304347826087) internal successors, (6374), 23 states have internal predecessors, (6374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:43,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:43,506 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:43,506 INFO L175 Difference]: Start difference. First operand has 171 places, 188 transitions, 3133 flow. Second operand 23 states and 6374 transitions. [2023-08-31 01:58:43,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 311 transitions, 5336 flow [2023-08-31 01:58:43,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 311 transitions, 5120 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-08-31 01:58:43,572 INFO L231 Difference]: Finished difference. Result has 160 places, 250 transitions, 4498 flow [2023-08-31 01:58:43,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4498, PETRI_PLACES=160, PETRI_TRANSITIONS=250} [2023-08-31 01:58:43,573 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2023-08-31 01:58:43,573 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 250 transitions, 4498 flow [2023-08-31 01:58:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 274.11538461538464) internal successors, (7127), 26 states have internal predecessors, (7127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:58:43,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 01:58:43,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 01:58:43,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-31 01:58:43,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:43,780 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 01:58:43,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 01:58:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1929977428, now seen corresponding path program 14 times [2023-08-31 01:58:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 01:58:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431609809] [2023-08-31 01:58:43,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 01:58:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 01:58:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 01:58:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 01:58:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431609809] [2023-08-31 01:58:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431609809] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 01:58:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551508653] [2023-08-31 01:58:47,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 01:58:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 01:58:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 01:58:47,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 01:58:47,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-31 01:58:48,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 01:58:48,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 01:58:48,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-31 01:58:48,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 01:58:48,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 01:58:48,541 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 60 treesize of output 56 [2023-08-31 01:58:49,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 01:58:49,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 149 [2023-08-31 01:58:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:58:49,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 01:58:54,239 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse32 (* c_~j~0 4))) (let ((.cse9 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse10 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse4 (+ c_~A~0.offset .cse32)) (.cse5 (+ c_~A~0.offset .cse32 4)) (.cse6 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (< (+ 2 c_~j~0) c_~N~0)) (.cse8 (<= c_~N~0 (+ c_~j~0 1))) (.cse19 (< (+ c_~i~0 1) c_~N~0))) (and (or (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse0 1)) (< (+ .cse1 c_~bag2~0 .cse2 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse0)) (= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2) (+ c_~bag1~0 c_~sum1~0 .cse0)) (< (+ c_~bag1~0 .cse0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse2)) (< 2147483647 (+ .cse1 c_~bag2~0 .cse2)) (< (+ c_~bag2~0 .cse2 2147483648) 0))))) .cse7 .cse8) (or .cse9 .cse10 (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse6)) (.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse11 1)) (< 2147483647 (+ c_~bag1~0 .cse11)) (< (+ .cse12 .cse13 2147483648) 0) (= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13) (+ c_~bag1~0 c_~sum1~0 .cse11)) (< (+ c_~bag1~0 .cse11 2147483648) 0) (< c_~bag2~0 (+ .cse12 1)) (< 2147483647 (+ c_~bag2~0 .cse13)))))) .cse7 .cse8) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse6)) (.cse17 (select .cse18 .cse5)) (.cse15 (select .cse18 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse15 2147483648) 0) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< 2147483647 (+ c_~bag1~0 .cse16)) (< (+ .cse17 .cse15 2147483648) 0) (= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse15) (+ c_~bag1~0 c_~sum1~0 .cse16)) (< (+ c_~bag1~0 .cse16 2147483648) 0) (< 2147483647 (+ .cse17 .cse15)) (< 2147483647 (+ c_~bag2~0 .cse15)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse15)) (< (+ c_~bag2~0 .cse15 2147483648) 0))))) .cse7 .cse8)))) .cse19) (or (< 2147483647 c_~cap1~0) (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) (and (or (and (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse6)) (.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse20)) (< (+ .cse21 .cse22 2147483648) 0) (= (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (< 2147483647 (+ c_~bag2~0 .cse22))))))) (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse6)) (.cse26 (select .cse27 .cse5)) (.cse24 (select .cse27 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse24 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse25)) (< (+ .cse26 .cse24 2147483648) 0) (= (+ .cse26 c_~bag2~0 c_~sum2~0 .cse24) (+ c_~bag1~0 c_~sum1~0 .cse25)) (< 2147483647 (+ .cse26 .cse24)) (< 2147483647 (+ c_~bag2~0 .cse24)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse24)) (< (+ c_~bag2~0 .cse24 2147483648) 0))))))) .cse9 .cse10) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5)) (.cse29 (select .cse31 .cse4))) (or (< (+ .cse28 c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse30)) (= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse29) (+ c_~bag1~0 c_~sum1~0 .cse30)) (< 2147483647 (+ c_~bag2~0 .cse29)) (< 2147483647 (+ .cse28 c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 2147483648) 0))))) .cse7 .cse8)) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19)))) (<= c_~N~0 c_~i~0)) is different from false [2023-08-31 01:58:58,922 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-31 01:58:58,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4550 treesize of output 2948 [2023-08-31 01:58:59,127 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2854 treesize of output 2782 [2023-08-31 01:58:59,316 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2775 treesize of output 2727 [2023-08-31 01:58:59,484 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2720 treesize of output 2660 [2023-08-31 01:58:59,625 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2653 treesize of output 2598 [2023-08-31 01:58:59,759 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2591 treesize of output 2512 [2023-08-31 01:58:59,899 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:58:59,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2505 treesize of output 2438 [2023-08-31 01:59:00,027 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2431 treesize of output 2376 [2023-08-31 01:59:00,168 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2369 treesize of output 2290 [2023-08-31 01:59:00,305 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2283 treesize of output 2216 [2023-08-31 01:59:00,499 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2209 treesize of output 2137 [2023-08-31 01:59:00,687 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2130 treesize of output 2082 [2023-08-31 01:59:00,842 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-08-31 01:59:00,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2075 treesize of output 2015 [2023-08-31 01:59:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 01:59:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551508653] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 01:59:04,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 01:59:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-08-31 01:59:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030422865] [2023-08-31 01:59:04,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 01:59:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-31 01:59:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 01:59:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-31 01:59:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1186, Unknown=7, NotChecked=72, Total=1482 [2023-08-31 01:59:04,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-08-31 01:59:04,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 250 transitions, 4498 flow. Second operand has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 01:59:04,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 01:59:04,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-08-31 01:59:04,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:00:07,612 INFO L130 PetriNetUnfolder]: 1503/2661 cut-off events. [2023-08-31 02:00:07,612 INFO L131 PetriNetUnfolder]: For 26526/26526 co-relation queries the response was YES. [2023-08-31 02:00:07,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22685 conditions, 2661 events. 1503/2661 cut-off events. For 26526/26526 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15819 event pairs, 2 based on Foata normal form. 18/2679 useless extension candidates. Maximal degree in co-relation 22640. Up to 860 conditions per place. [2023-08-31 02:00:07,629 INFO L137 encePairwiseOnDemand]: 747/759 looper letters, 268 selfloop transitions, 660 changer transitions 38/966 dead transitions. [2023-08-31 02:00:07,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 966 transitions, 16438 flow [2023-08-31 02:00:07,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-08-31 02:00:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-08-31 02:00:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 19385 transitions. [2023-08-31 02:00:07,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31146566406375525 [2023-08-31 02:00:07,648 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 19385 transitions. [2023-08-31 02:00:07,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 19385 transitions. [2023-08-31 02:00:07,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:00:07,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 19385 transitions. [2023-08-31 02:00:07,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 236.40243902439025) internal successors, (19385), 82 states have internal predecessors, (19385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:00:07,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:00:07,715 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:00:07,716 INFO L175 Difference]: Start difference. First operand has 160 places, 250 transitions, 4498 flow. Second operand 82 states and 19385 transitions. [2023-08-31 02:00:07,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 966 transitions, 16438 flow [2023-08-31 02:00:07,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 966 transitions, 15833 flow, removed 189 selfloop flow, removed 10 redundant places. [2023-08-31 02:00:07,915 INFO L231 Difference]: Finished difference. Result has 244 places, 730 transitions, 14508 flow [2023-08-31 02:00:07,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4213, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=14508, PETRI_PLACES=244, PETRI_TRANSITIONS=730} [2023-08-31 02:00:07,915 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2023-08-31 02:00:07,916 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 730 transitions, 14508 flow [2023-08-31 02:00:07,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:00:07,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:00:07,917 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:00:07,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-31 02:00:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:00:08,123 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 02:00:08,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:00:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1040341450, now seen corresponding path program 15 times [2023-08-31 02:00:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:00:08,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313105547] [2023-08-31 02:00:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:00:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:00:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:00:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:00:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:00:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313105547] [2023-08-31 02:00:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313105547] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:00:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62326699] [2023-08-31 02:00:10,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 02:00:10,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:00:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:00:10,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:00:10,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-31 02:00:10,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 02:00:10,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:00:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-31 02:00:10,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:00:11,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:00:11,131 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-31 02:00:11,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:00:11,856 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 319 treesize of output 191 [2023-08-31 02:00:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:00:12,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:00:20,918 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:20,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2568 treesize of output 1822 [2023-08-31 02:00:21,002 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1784 treesize of output 1697 [2023-08-31 02:00:21,082 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1670 treesize of output 1607 [2023-08-31 02:00:21,159 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1580 treesize of output 1505 [2023-08-31 02:00:21,245 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1478 treesize of output 1427 [2023-08-31 02:00:21,332 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1400 treesize of output 1325 [2023-08-31 02:00:21,420 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:00:21,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1298 treesize of output 1235 [2023-08-31 02:01:39,644 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:01:39,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1395 treesize of output 1003 [2023-08-31 02:01:39,823 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:01:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 902 treesize of output 839 [2023-08-31 02:01:39,891 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:01:39,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 812 treesize of output 725 [2023-08-31 02:01:39,961 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-31 02:01:39,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 698 treesize of output 623 [2023-08-31 02:02:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:02:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62326699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:02:03,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:02:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2023-08-31 02:02:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570967676] [2023-08-31 02:02:03,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:02:03,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 02:02:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:02:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 02:02:03,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1147, Unknown=7, NotChecked=0, Total=1332 [2023-08-31 02:02:09,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-08-31 02:02:09,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 730 transitions, 14508 flow. Second operand has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:02:09,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:02:09,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-08-31 02:02:09,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:02:35,689 WARN L222 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 261 DAG size of output: 207 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:03:13,750 WARN L222 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 309 DAG size of output: 228 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:03:39,728 WARN L222 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 280 DAG size of output: 220 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:03:41,792 INFO L130 PetriNetUnfolder]: 2413/4253 cut-off events. [2023-08-31 02:03:41,792 INFO L131 PetriNetUnfolder]: For 70830/70830 co-relation queries the response was YES. [2023-08-31 02:03:41,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43532 conditions, 4253 events. 2413/4253 cut-off events. For 70830/70830 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27456 event pairs, 37 based on Foata normal form. 24/4277 useless extension candidates. Maximal degree in co-relation 43472. Up to 1274 conditions per place. [2023-08-31 02:03:41,828 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 439 selfloop transitions, 1063 changer transitions 24/1526 dead transitions. [2023-08-31 02:03:41,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1526 transitions, 31552 flow [2023-08-31 02:03:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-08-31 02:03:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2023-08-31 02:03:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 26712 transitions. [2023-08-31 02:03:41,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31144845919759345 [2023-08-31 02:03:41,851 INFO L72 ComplementDD]: Start complementDD. Operand 113 states and 26712 transitions. [2023-08-31 02:03:41,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 26712 transitions. [2023-08-31 02:03:41,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:03:41,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 113 states and 26712 transitions. [2023-08-31 02:03:41,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 114 states, 113 states have (on average 236.38938053097345) internal successors, (26712), 113 states have internal predecessors, (26712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:03:41,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:03:41,949 INFO L81 ComplementDD]: Finished complementDD. Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:03:41,950 INFO L175 Difference]: Start difference. First operand has 244 places, 730 transitions, 14508 flow. Second operand 113 states and 26712 transitions. [2023-08-31 02:03:41,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1526 transitions, 31552 flow [2023-08-31 02:03:42,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1526 transitions, 29510 flow, removed 425 selfloop flow, removed 12 redundant places. [2023-08-31 02:03:42,530 INFO L231 Difference]: Finished difference. Result has 351 places, 1229 transitions, 26071 flow [2023-08-31 02:03:42,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=13305, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=608, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=26071, PETRI_PLACES=351, PETRI_TRANSITIONS=1229} [2023-08-31 02:03:42,531 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 331 predicate places. [2023-08-31 02:03:42,531 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1229 transitions, 26071 flow [2023-08-31 02:03:42,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:03:42,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:03:42,532 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:03:42,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-31 02:03:42,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:03:42,737 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 02:03:42,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:03:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1068047080, now seen corresponding path program 16 times [2023-08-31 02:03:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:03:42,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722619289] [2023-08-31 02:03:42,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:03:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:03:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:04:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:04:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:04:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722619289] [2023-08-31 02:04:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722619289] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:04:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571524485] [2023-08-31 02:04:18,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 02:04:18,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:04:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:04:18,522 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:04:18,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-31 02:04:18,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 02:04:18,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:04:18,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-31 02:04:18,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:04:18,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 02:04:18,793 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 6 treesize of output 5 [2023-08-31 02:04:18,890 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 6 treesize of output 5 [2023-08-31 02:04:19,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:04:19,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 180 [2023-08-31 02:04:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:04:20,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:04:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-31 02:04:36,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571524485] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:04:36,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:04:36,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2023-08-31 02:04:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840595172] [2023-08-31 02:04:36,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:04:36,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-31 02:04:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:04:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-31 02:04:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=877, Unknown=3, NotChecked=0, Total=1056 [2023-08-31 02:04:41,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-08-31 02:04:41,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1229 transitions, 26071 flow. Second operand has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:04:41,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:04:41,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-08-31 02:04:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:05:08,508 WARN L222 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 276 DAG size of output: 274 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:05:19,392 WARN L222 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 269 DAG size of output: 256 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:05:40,514 WARN L222 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 249 DAG size of output: 247 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:05:52,490 INFO L130 PetriNetUnfolder]: 2210/3873 cut-off events. [2023-08-31 02:05:52,490 INFO L131 PetriNetUnfolder]: For 61034/61034 co-relation queries the response was YES. [2023-08-31 02:05:52,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40966 conditions, 3873 events. 2210/3873 cut-off events. For 61034/61034 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24433 event pairs, 35 based on Foata normal form. 17/3890 useless extension candidates. Maximal degree in co-relation 40895. Up to 1148 conditions per place. [2023-08-31 02:05:52,527 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 308 selfloop transitions, 992 changer transitions 23/1323 dead transitions. [2023-08-31 02:05:52,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1323 transitions, 29203 flow [2023-08-31 02:05:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-31 02:05:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-31 02:05:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 16518 transitions. [2023-08-31 02:05:52,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3108977978543196 [2023-08-31 02:05:52,538 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 16518 transitions. [2023-08-31 02:05:52,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 16518 transitions. [2023-08-31 02:05:52,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 02:05:52,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 16518 transitions. [2023-08-31 02:05:52,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 235.97142857142856) internal successors, (16518), 70 states have internal predecessors, (16518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:05:52,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:05:52,587 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:05:52,587 INFO L175 Difference]: Start difference. First operand has 351 places, 1229 transitions, 26071 flow. Second operand 70 states and 16518 transitions. [2023-08-31 02:05:52,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1323 transitions, 29203 flow [2023-08-31 02:05:53,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1323 transitions, 27195 flow, removed 917 selfloop flow, removed 24 redundant places. [2023-08-31 02:05:53,341 INFO L231 Difference]: Finished difference. Result has 380 places, 1154 transitions, 25275 flow [2023-08-31 02:05:53,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=19628, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=839, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=25275, PETRI_PLACES=380, PETRI_TRANSITIONS=1154} [2023-08-31 02:05:53,342 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 360 predicate places. [2023-08-31 02:05:53,343 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1154 transitions, 25275 flow [2023-08-31 02:05:53,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:05:53,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 02:05:53,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 02:05:53,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-31 02:05:53,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:05:53,550 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-31 02:05:53,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 02:05:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -105131752, now seen corresponding path program 17 times [2023-08-31 02:05:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 02:05:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648509254] [2023-08-31 02:05:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 02:05:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 02:05:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 02:05:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:05:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 02:05:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648509254] [2023-08-31 02:05:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648509254] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 02:05:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373579445] [2023-08-31 02:05:55,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 02:05:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 02:05:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 02:05:55,778 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 02:05:55,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-31 02:05:55,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-31 02:05:55,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 02:05:55,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-31 02:05:55,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 02:05:55,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 02:05:56,048 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 6 treesize of output 5 [2023-08-31 02:05:56,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 02:05:56,715 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 36 treesize of output 32 [2023-08-31 02:05:57,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:05:57,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 154 [2023-08-31 02:05:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 02:05:57,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 02:05:59,451 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse2 (let ((.cse19 (* c_~j~0 4))) (let ((.cse7 (+ c_~bag1~0 c_~sum1~0 .cse1)) (.cse10 (+ c_~A~0.offset .cse19)) (.cse9 (+ c_~A~0.offset .cse19 4)) (.cse11 (< (+ 2 c_~j~0) c_~N~0)) (.cse12 (<= c_~N~0 (+ c_~j~0 1)))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse5 (select .cse8 .cse10)) (.cse6 (select .cse8 .cse9))) (or (< 2147483647 (+ c_~bag2~0 .cse5)) (= (+ c_~bag2~0 .cse5 .cse6 c_~sum2~0) .cse7) (< (+ .cse5 .cse6 2147483648) 0) (< c_~bag2~0 (+ .cse6 1)))))) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse10)) (.cse14 (select .cse15 .cse9))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 c_~sum2~0)) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse7) (< (+ .cse13 .cse14 2147483648) 0) (< (+ c_~bag2~0 .cse13 2147483648) 0) (< 2147483647 (+ .cse13 .cse14)))))) .cse11 .cse12)) (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse9)) (.cse16 (select .cse18 .cse10))) (or (< 2147483647 (+ c_~bag2~0 .cse16)) (= (+ c_~bag2~0 .cse16 .cse17 c_~sum2~0) .cse7) (< (+ c_~bag2~0 .cse16 .cse17 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse16 .cse17)) (< (+ c_~bag2~0 .cse16 2147483648) 0))))) .cse11 .cse12))))) (.cse3 (< (+ c_~i~0 1) c_~N~0)) (.cse4 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or .cse0 (< 2147483647 (+ c_~bag1~0 .cse1)) .cse2 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse3 (< (+ c_~bag1~0 .cse1 2147483648) 0) .cse4) (or .cse0 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse2 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse3 .cse4)))) is different from false [2023-08-31 02:06:05,640 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< 2 c_~N~0)) (.cse0 (<= c_~N~0 1)) (.cse2 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse27 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse27 .cse8))) (let ((.cse21 (+ .cse25 .cse26))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (select .cse23 .cse8))) (let ((.cse22 (+ .cse19 .cse20))) (or (< (+ .cse19 2147483648 .cse20) 0) (= .cse21 .cse22) (< (+ .cse19 2147483648) 0) (< 2147483647 .cse19) (< 2147483647 .cse22)))))) (< (+ .cse25 .cse26 2147483648) 0) (< (+ .cse25 2147483648) 0) (< 2147483647 .cse25) (< 2147483647 .cse21))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse35 .cse8))) (let ((.cse32 (+ .cse28 .cse29))) (or (< (+ .cse28 .cse29 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse33 .cse8))) (or (< (+ .cse30 2147483648 .cse31) 0) (= .cse32 (+ .cse30 .cse31)) (< 2147483647 .cse30) (< 0 (+ .cse31 1)))))) (< (+ .cse28 2147483648) 0) (< 2147483647 .cse28) (< 2147483647 .cse32)))))))))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse1 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse10 .cse8)) (.cse3 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse3 .cse4 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse7 .cse8))) (or (< (+ .cse5 2147483648 .cse6) 0) (= (+ .cse3 .cse4) (+ .cse5 .cse6)) (< 2147483647 .cse5) (< 0 (+ .cse6 1)))))) (< 0 (+ .cse4 1)) (< 2147483647 .cse3)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse18 .cse8)) (.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (select .cse16 .cse8))) (let ((.cse15 (+ .cse11 .cse12))) (or (< (+ .cse11 2147483648 .cse12) 0) (= (+ .cse13 .cse14) .cse15) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse11) (< 2147483647 .cse15)))))) (< (+ .cse13 .cse14 2147483648) 0) (< 0 (+ .cse14 1)) (< 2147483647 .cse13)))))))))) (or .cse1 .cse0 .cse2)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2023-08-31 02:06:05,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:06:05,932 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 386 treesize of output 206 [2023-08-31 02:06:05,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:06:05,943 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 584 treesize of output 488 [2023-08-31 02:06:05,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 248 [2023-08-31 02:06:05,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-31 02:06:05,982 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 184 treesize of output 146 [2023-08-31 02:06:06,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:06:06,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 1 [2023-08-31 02:06:06,069 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:06:06,070 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 343 treesize of output 1 [2023-08-31 02:06:06,078 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:06:06,078 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 294 treesize of output 1 [2023-08-31 02:06:06,093 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:06:06,093 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 386 treesize of output 1 [2023-08-31 02:06:06,103 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-31 02:06:06,104 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 337 treesize of output 1 [2023-08-31 02:06:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-31 02:06:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373579445] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 02:06:06,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 02:06:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2023-08-31 02:06:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789758416] [2023-08-31 02:06:06,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 02:06:06,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-31 02:06:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 02:06:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-31 02:06:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1199, Unknown=8, NotChecked=146, Total=1560 [2023-08-31 02:06:06,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-08-31 02:06:06,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1154 transitions, 25275 flow. Second operand has 40 states, 40 states have (on average 232.45) internal successors, (9298), 40 states have internal predecessors, (9298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 02:06:06,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 02:06:06,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-08-31 02:06:06,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 02:06:06,703 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 2 c_~N~0)) (.cse1 (<= c_~N~0 1)) (.cse3 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse3)) (or (let ((.cse10 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse29 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse28 (select .cse29 .cse10))) (let ((.cse23 (+ .cse27 .cse28))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse25 (select (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse25 .cse10))) (let ((.cse24 (+ .cse21 .cse22))) (or (< (+ .cse21 2147483648 .cse22) 0) (= .cse23 .cse24) (< (+ .cse21 2147483648) 0) (< 2147483647 .cse21) (< 2147483647 .cse24)))))) (< (+ .cse27 .cse28 2147483648) 0) (< (+ .cse27 2147483648) 0) (< 2147483647 .cse27) (< 2147483647 .cse23))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse37 .cse10))) (let ((.cse34 (+ .cse30 .cse31))) (or (< (+ .cse30 .cse31 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (select .cse35 .cse10))) (or (< (+ .cse32 2147483648 .cse33) 0) (= .cse34 (+ .cse32 .cse33)) (< 2147483647 .cse32) (< 0 (+ .cse33 1)))))) (< (+ .cse30 2147483648) 0) (< 2147483647 .cse30) (< 2147483647 .cse34)))))))))) (and (or .cse1 (and (or .cse0 .cse4) (or .cse0 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse12 .cse10)) (.cse5 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse5 .cse6 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select .cse9 .cse10))) (or (< (+ .cse7 2147483648 .cse8) 0) (= (+ .cse5 .cse6) (+ .cse7 .cse8)) (< 2147483647 .cse7) (< 0 (+ .cse8 1)))))) (< 0 (+ .cse6 1)) (< 2147483647 .cse5)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse20 .cse10)) (.cse15 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select .cse18 .cse10))) (let ((.cse17 (+ .cse13 .cse14))) (or (< (+ .cse13 2147483648 .cse14) 0) (= (+ .cse15 .cse16) .cse17) (< (+ .cse13 2147483648) 0) (< 2147483647 .cse13) (< 2147483647 .cse17)))))) (< (+ .cse15 .cse16 2147483648) 0) (< 0 (+ .cse16 1)) (< 2147483647 .cse15)))))))))) (or .cse0 .cse1 .cse4)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse1 (< .cse3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2))) is different from false [2023-08-31 02:06:17,158 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse35 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse36 (* c_~j~0 4))) (let ((.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse5 (+ c_~A~0.offset .cse36)) (.cse4 (+ c_~A~0.offset .cse36 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse16 (+ c_~bag1~0 .cse35))) (let ((.cse17 (< 2147483647 .cse16)) (.cse20 (< (+ c_~bag1~0 .cse35 2147483648) 0)) (.cse23 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse21 (< 2147483647 .cse2)) (.cse18 (let ((.cse27 (+ c_~bag1~0 c_~sum1~0 .cse35))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse25 (select .cse28 .cse5)) (.cse26 (select .cse28 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse25)) (= (+ c_~bag2~0 .cse25 .cse26 c_~sum2~0) .cse27) (< (+ .cse25 .cse26 2147483648) 0) (< c_~bag2~0 (+ .cse26 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse5)) (.cse30 (select .cse31 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse29 c_~sum2~0)) (= (+ c_~bag2~0 .cse29 .cse30 c_~sum2~0) .cse27) (< (+ .cse29 .cse30 2147483648) 0) (< (+ c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ .cse29 .cse30)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse4)) (.cse32 (select .cse34 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse32)) (= (+ c_~bag2~0 .cse32 .cse33 c_~sum2~0) .cse27) (< (+ c_~bag2~0 .cse32 .cse33 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse32 .cse33)) (< (+ c_~bag2~0 .cse32 2147483648) 0))))) .cse6 .cse7)))) (.cse22 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse24 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or (and (or (<= c_~cap1~0 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse17 .cse21 .cse18 .cse22 .cse19 .cse20)) (<= c_~N~0 c_~i~0)) (or .cse23 .cse17 .cse18 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse19 .cse20 .cse24) (or .cse23 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) .cse21 .cse18 .cse22 .cse19 .cse24))))) is different from false [2023-08-31 02:06:35,869 WARN L222 SmtUtils]: Spent 17.07s on a formula simplification. DAG size of input: 208 DAG size of output: 207 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:06:55,667 WARN L222 SmtUtils]: Spent 14.94s on a formula simplification. DAG size of input: 212 DAG size of output: 211 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:07:07,801 WARN L222 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 196 DAG size of output: 195 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 02:07:30,115 WARN L222 SmtUtils]: Spent 14.98s on a formula simplification. DAG size of input: 200 DAG size of output: 199 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15