./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.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 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:27:02,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:27:02,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:27:02,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:27:02,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:27:02,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:27:02,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:27:02,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:27:02,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:27:02,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:27:02,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:27:02,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:27:02,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:27:02,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:27:02,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:27:02,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:27:02,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:27:02,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:27:02,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:27:02,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:27:02,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:27:02,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:27:02,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:27:02,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:27:02,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:27:02,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:27:02,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:27:02,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:27:02,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:27:02,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:27:02,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:27:02,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:27:02,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:27:02,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:27:02,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:27:02,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:27:02,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:27:02,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:27:02,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:27:02,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:27:02,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:27:02,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:27:02,448 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:27:02,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:27:02,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:27:02,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:27:02,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:27:02,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:27:02,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:27:02,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:27:02,452 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:27:02,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:27:02,453 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:27:02,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:27:02,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:27:02,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:27:02,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:27:02,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:27:02,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:27:02,454 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:27:02,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:27:02,454 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:27:02,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:27:02,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:27:02,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:27:02,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:27:02,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:27:02,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:27:02,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:27:02,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:27:02,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:27:02,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:27:02,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:27:02,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:27:02,457 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:27:02,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:27:02,457 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:27:02,458 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 -> 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 20:27:02,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:27:02,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:27:02,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:27:02,785 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:27:02,785 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:27:02,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-08-30 20:27:03,765 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:27:03,956 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:27:03,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-08-30 20:27:03,962 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f3e3e1/facc5dca48ac44b395b7b2c41c7009f7/FLAG437125e11 [2023-08-30 20:27:03,972 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f3e3e1/facc5dca48ac44b395b7b2c41c7009f7 [2023-08-30 20:27:03,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:27:03,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:27:03,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:27:03,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:27:03,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:27:03,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:27:03" (1/1) ... [2023-08-30 20:27:03,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34adbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:03, skipping insertion in model container [2023-08-30 20:27:03,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:27:03" (1/1) ... [2023-08-30 20:27:03,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:27:04,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:27:04,202 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/popl20-min-max-inc.wvr.c[3018,3031] [2023-08-30 20:27:04,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:27:04,232 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:27:04,271 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/popl20-min-max-inc.wvr.c[3018,3031] [2023-08-30 20:27:04,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:27:04,286 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:27:04,286 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:27:04,292 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:27:04,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04 WrapperNode [2023-08-30 20:27:04,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:27:04,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:27:04,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:27:04,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:27:04,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,348 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-08-30 20:27:04,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:27:04,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:27:04,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:27:04,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:27:04,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:27:04,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:27:04,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:27:04,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:27:04,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (1/1) ... [2023-08-30 20:27:04,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:27:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:27:04,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 20:27:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 20:27:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:27:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:27:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:27:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:27:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:27:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:27:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:27:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:27:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:27:04,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:27:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 20:27:04,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 20:27:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:27:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:27:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:27:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:27:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:27:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:27:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:27:04,468 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:27:04,640 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:27:04,645 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:27:04,974 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:27:05,035 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:27:05,035 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 20:27:05,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:27:05 BoogieIcfgContainer [2023-08-30 20:27:05,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:27:05,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:27:05,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:27:05,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:27:05,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:27:03" (1/3) ... [2023-08-30 20:27:05,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4c3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:27:05, skipping insertion in model container [2023-08-30 20:27:05,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:27:04" (2/3) ... [2023-08-30 20:27:05,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a4c3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:27:05, skipping insertion in model container [2023-08-30 20:27:05,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:27:05" (3/3) ... [2023-08-30 20:27:05,044 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-08-30 20:27:05,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:27:05,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:27:05,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:27:05,063 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:27:05,158 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 20:27:05,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-08-30 20:27:05,298 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-08-30 20:27:05,298 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:27:05,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-08-30 20:27:05,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-08-30 20:27:05,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-08-30 20:27:05,315 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:27:05,324 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-08-30 20:27:05,328 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-08-30 20:27:05,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-08-30 20:27:05,377 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-08-30 20:27:05,377 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:27:05,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-08-30 20:27:05,382 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-08-30 20:27:10,035 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-08-30 20:27:10,036 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-30 20:27:10,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:27:10,053 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;@666ca6e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:27:10,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 20:27:10,061 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-08-30 20:27:10,061 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:27:10,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:10,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:10,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:10,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1385427649, now seen corresponding path program 1 times [2023-08-30 20:27:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307996582] [2023-08-30 20:27:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:27:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307996582] [2023-08-30 20:27:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307996582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:27:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970993005] [2023-08-30 20:27:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:10,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:27:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:27:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:27:10,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-30 20:27:10,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:10,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:10,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-30 20:27:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:10,865 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-08-30 20:27:10,866 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-30 20:27:10,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-08-30 20:27:10,882 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-30 20:27:10,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-30 20:27:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:27:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:27:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-30 20:27:10,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-08-30 20:27:10,902 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-30 20:27:10,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-30 20:27:10,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:10,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-30 20:27:10,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:10,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:10,920 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:10,922 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 586 transitions. [2023-08-30 20:27:10,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-30 20:27:10,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 20:27:10,931 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-30 20:27:10,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-30 20:27:10,936 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-30 20:27:10,938 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-30 20:27:10,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:10,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:10,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:10,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:27:10,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:10,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-08-30 20:27:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289984366] [2023-08-30 20:27:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289984366] [2023-08-30 20:27:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289984366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:27:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013460028] [2023-08-30 20:27:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:11,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:27:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:27:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:27:11,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-30 20:27:11,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:11,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-30 20:27:11,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:11,422 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-08-30 20:27:11,423 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-08-30 20:27:11,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-08-30 20:27:11,434 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-30 20:27:11,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-30 20:27:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:27:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:27:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2023-08-30 20:27:11,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49746621621621623 [2023-08-30 20:27:11,437 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2023-08-30 20:27:11,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2023-08-30 20:27:11,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:11,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2023-08-30 20:27:11,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,442 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 589 transitions. [2023-08-30 20:27:11,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-30 20:27:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 20:27:11,445 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-30 20:27:11,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-30 20:27:11,446 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-30 20:27:11,446 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-30 20:27:11,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:11,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:27:11,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:11,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-08-30 20:27:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563323791] [2023-08-30 20:27:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:11,555 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-30 20:27:11,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563323791] [2023-08-30 20:27:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563323791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:27:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615510587] [2023-08-30 20:27:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:11,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:27:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:11,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:27:11,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:27:11,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-08-30 20:27:11,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:11,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-08-30 20:27:11,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:11,806 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-08-30 20:27:11,807 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-08-30 20:27:11,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-08-30 20:27:11,817 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-30 20:27:11,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-30 20:27:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:27:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:27:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-30 20:27:11,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49493243243243246 [2023-08-30 20:27:11,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-30 20:27:11,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-30 20:27:11,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:11,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-30 20:27:11,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,825 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 586 transitions. [2023-08-30 20:27:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-30 20:27:11,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 20:27:11,828 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-30 20:27:11,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-30 20:27:11,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-30 20:27:11,832 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-30 20:27:11,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:11,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:11,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:11,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 20:27:11,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:11,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-08-30 20:27:11,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:11,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169704360] [2023-08-30 20:27:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:27:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169704360] [2023-08-30 20:27:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169704360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:27:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088917495] [2023-08-30 20:27:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:11,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:27:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:27:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:27:12,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 296 [2023-08-30 20:27:12,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:12,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:12,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 296 [2023-08-30 20:27:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:12,226 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-08-30 20:27:12,227 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-08-30 20:27:12,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-08-30 20:27:12,237 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-30 20:27:12,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-30 20:27:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:27:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:27:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-30 20:27:12,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48873873873873874 [2023-08-30 20:27:12,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-30 20:27:12,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-30 20:27:12,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:12,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-30 20:27:12,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:12,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:12,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:12,245 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 434 transitions. [2023-08-30 20:27:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-30 20:27:12,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 20:27:12,247 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-30 20:27:12,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-30 20:27:12,248 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 20:27:12,248 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-30 20:27:12,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:12,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:12,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:12,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 20:27:12,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:12,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-08-30 20:27:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905200782] [2023-08-30 20:27:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905200782] [2023-08-30 20:27:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905200782] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:27:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375847394] [2023-08-30 20:27:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:27:12,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:27:12,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 20:27:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:13,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-30 20:27:13,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:27:13,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:27:13,239 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-30 20:27:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:27:13,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 20:27:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:27:13,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 20:27:13,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-08-30 20:27:13,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:27:13,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:27:13,789 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 43 treesize of output 27 [2023-08-30 20:27:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:27:13,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:27:16,643 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (<= 2147483647 .cse0) (forall ((v_ArrVal_186 Int) (v_ArrVal_188 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse2 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1)))))))) is different from false [2023-08-30 20:27:16,670 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse2 c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset)) (.cse1 (select (select (store (store .cse2 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1)))))) is different from false [2023-08-30 20:27:17,185 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min~0) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse1 (select .cse3 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse1 1)) (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1)) (<= 2147483647 .cse1))))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse5 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse5) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse8 (select .cse9 c_~A~0.base))) (let ((.cse7 (select (select (store (store .cse9 c_~A~0.base (store .cse8 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse6 (select .cse8 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse6 1)) (<= 2147483647 .cse7) (<= .cse5 (+ .cse7 1)) (<= 2147483647 .cse6))))))))))) is different from false [2023-08-30 20:27:17,281 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse0 (select .cse3 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse0 1)) (<= 2147483647 .cse1) (<= .cse2 (+ .cse1 1)) (<= 2147483647 .cse0)))))) (< .cse6 .cse2))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse7 c_~A~0.base) c_~A~0.offset) .cse6) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse11 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse10 (select .cse11 c_~A~0.base))) (let ((.cse9 (select (select (store (store .cse11 c_~A~0.base (store .cse10 c_~A~0.offset v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset)) (.cse8 (select .cse10 c_~A~0.offset))) (or (< v_ArrVal_186 (+ .cse8 1)) (<= .cse6 (+ .cse9 1)) (<= 2147483647 .cse9) (<= 2147483647 .cse8))))))))))) is different from false [2023-08-30 20:27:17,425 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse1) (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_186 (+ .cse2 1)) (<= 2147483647 .cse3) (<= 2147483647 .cse2) (<= .cse1 (+ .cse3 1))))))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_186 Int) (v_ArrVal_185 (Array Int Int)) (v_ArrVal_188 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select (select (store (store .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_186)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_186 (+ .cse7 1)) (<= 2147483647 .cse8) (<= 2147483647 .cse7) (<= .cse9 (+ .cse8 1))))))) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse9))))))) is different from false [2023-08-30 20:27:17,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:27:17,476 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 247 treesize of output 151 [2023-08-30 20:27:17,494 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 6735 treesize of output 6431 [2023-08-30 20:27:17,613 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 411 treesize of output 383 [2023-08-30 20:27:17,635 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 467 treesize of output 435 [2023-08-30 20:27:17,658 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 356 treesize of output 342 [2023-08-30 20:27:17,683 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 117 treesize of output 101 [2023-08-30 20:27:18,807 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:27:18,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2023-08-30 20:27:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 20:27:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375847394] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:27:18,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:27:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 38 [2023-08-30 20:27:18,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565857361] [2023-08-30 20:27:18,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:27:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-30 20:27:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-30 20:27:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1004, Unknown=30, NotChecked=350, Total=1560 [2023-08-30 20:27:18,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 296 [2023-08-30 20:27:18,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 40 states, 40 states have (on average 84.325) internal successors, (3373), 40 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:18,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:18,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 296 [2023-08-30 20:27:18,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:25,604 INFO L130 PetriNetUnfolder]: 11330/15592 cut-off events. [2023-08-30 20:27:25,604 INFO L131 PetriNetUnfolder]: For 4161/4161 co-relation queries the response was YES. [2023-08-30 20:27:25,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40013 conditions, 15592 events. 11330/15592 cut-off events. For 4161/4161 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 80468 event pairs, 163 based on Foata normal form. 7/12538 useless extension candidates. Maximal degree in co-relation 39999. Up to 3235 conditions per place. [2023-08-30 20:27:25,660 INFO L137 encePairwiseOnDemand]: 284/296 looper letters, 250 selfloop transitions, 67 changer transitions 314/631 dead transitions. [2023-08-30 20:27:25,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 631 transitions, 3144 flow [2023-08-30 20:27:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-30 20:27:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-30 20:27:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4272 transitions. [2023-08-30 20:27:25,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207207207207207 [2023-08-30 20:27:25,673 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4272 transitions. [2023-08-30 20:27:25,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4272 transitions. [2023-08-30 20:27:25,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:25,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4272 transitions. [2023-08-30 20:27:25,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 94.93333333333334) internal successors, (4272), 45 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:25,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 296.0) internal successors, (13616), 46 states have internal predecessors, (13616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:25,701 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 296.0) internal successors, (13616), 46 states have internal predecessors, (13616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:25,702 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 45 states and 4272 transitions. [2023-08-30 20:27:25,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 631 transitions, 3144 flow [2023-08-30 20:27:25,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 631 transitions, 3140 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 20:27:25,813 INFO L231 Difference]: Finished difference. Result has 115 places, 123 transitions, 762 flow [2023-08-30 20:27:25,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=762, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2023-08-30 20:27:25,814 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2023-08-30 20:27:25,814 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 762 flow [2023-08-30 20:27:25,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 84.325) internal successors, (3373), 40 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:25,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:25,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:25,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 20:27:26,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:26,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:26,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1897529506, now seen corresponding path program 2 times [2023-08-30 20:27:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725985305] [2023-08-30 20:27:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:27:26,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725985305] [2023-08-30 20:27:26,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725985305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:26,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:27:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442205123] [2023-08-30 20:27:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:27:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:27:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:27:26,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-08-30 20:27:26,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 123 transitions, 762 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:26,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:26,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-08-30 20:27:26,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:27,751 INFO L130 PetriNetUnfolder]: 8032/11272 cut-off events. [2023-08-30 20:27:27,751 INFO L131 PetriNetUnfolder]: For 93814/95153 co-relation queries the response was YES. [2023-08-30 20:27:27,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48287 conditions, 11272 events. 8032/11272 cut-off events. For 93814/95153 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 58739 event pairs, 1242 based on Foata normal form. 1109/11520 useless extension candidates. Maximal degree in co-relation 48236. Up to 6597 conditions per place. [2023-08-30 20:27:27,811 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 95 selfloop transitions, 5 changer transitions 208/309 dead transitions. [2023-08-30 20:27:27,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 309 transitions, 2548 flow [2023-08-30 20:27:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:27:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:27:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2023-08-30 20:27:27,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081 [2023-08-30 20:27:27,815 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2023-08-30 20:27:27,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2023-08-30 20:27:27,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:27,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2023-08-30 20:27:27,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:27,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:27,819 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:27,820 INFO L175 Difference]: Start difference. First operand has 115 places, 123 transitions, 762 flow. Second operand 5 states and 752 transitions. [2023-08-30 20:27:27,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 309 transitions, 2548 flow [2023-08-30 20:27:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 309 transitions, 2475 flow, removed 35 selfloop flow, removed 14 redundant places. [2023-08-30 20:27:28,036 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 446 flow [2023-08-30 20:27:28,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=446, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2023-08-30 20:27:28,037 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2023-08-30 20:27:28,037 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 446 flow [2023-08-30 20:27:28,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:28,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:28,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:28,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 20:27:28,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:28,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 701964876, now seen corresponding path program 3 times [2023-08-30 20:27:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799583985] [2023-08-30 20:27:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:27:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799583985] [2023-08-30 20:27:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799583985] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:27:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644270458] [2023-08-30 20:27:28,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:27:28,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:27:28,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:27:28,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 20:27:28,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 20:27:28,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:27:28,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 20:27:28,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:27:28,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:27:28,673 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 15 treesize of output 7 [2023-08-30 20:27:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:27:28,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:27:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:27:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644270458] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 20:27:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 20:27:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 16 [2023-08-30 20:27:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035304600] [2023-08-30 20:27:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 20:27:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 20:27:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-08-30 20:27:29,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-08-30 20:27:29,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:29,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:29,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-08-30 20:27:29,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:30,412 INFO L130 PetriNetUnfolder]: 9804/13754 cut-off events. [2023-08-30 20:27:30,413 INFO L131 PetriNetUnfolder]: For 135224/137230 co-relation queries the response was YES. [2023-08-30 20:27:30,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60048 conditions, 13754 events. 9804/13754 cut-off events. For 135224/137230 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 74070 event pairs, 1623 based on Foata normal form. 1582/14080 useless extension candidates. Maximal degree in co-relation 60007. Up to 4717 conditions per place. [2023-08-30 20:27:30,468 INFO L137 encePairwiseOnDemand]: 288/296 looper letters, 124 selfloop transitions, 13 changer transitions 170/308 dead transitions. [2023-08-30 20:27:30,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 308 transitions, 2376 flow [2023-08-30 20:27:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 20:27:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 20:27:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1006 transitions. [2023-08-30 20:27:30,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855212355212355 [2023-08-30 20:27:30,471 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1006 transitions. [2023-08-30 20:27:30,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1006 transitions. [2023-08-30 20:27:30,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:30,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1006 transitions. [2023-08-30 20:27:30,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.71428571428572) internal successors, (1006), 7 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:30,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:30,478 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:30,478 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 446 flow. Second operand 7 states and 1006 transitions. [2023-08-30 20:27:30,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 308 transitions, 2376 flow [2023-08-30 20:27:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 308 transitions, 2233 flow, removed 57 selfloop flow, removed 15 redundant places. [2023-08-30 20:27:30,649 INFO L231 Difference]: Finished difference. Result has 70 places, 88 transitions, 595 flow [2023-08-30 20:27:30,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=70, PETRI_TRANSITIONS=88} [2023-08-30 20:27:30,650 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-30 20:27:30,650 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 595 flow [2023-08-30 20:27:30,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:30,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:30,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:30,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 20:27:30,857 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-30 20:27:30,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:30,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1896766330, now seen corresponding path program 4 times [2023-08-30 20:27:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831749046] [2023-08-30 20:27:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:27:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831749046] [2023-08-30 20:27:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831749046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:27:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:27:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:27:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825388151] [2023-08-30 20:27:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:27:31,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:27:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:27:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:27:31,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 296 [2023-08-30 20:27:31,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:31,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:31,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 296 [2023-08-30 20:27:31,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:31,929 INFO L130 PetriNetUnfolder]: 6863/9780 cut-off events. [2023-08-30 20:27:31,930 INFO L131 PetriNetUnfolder]: For 31304/32506 co-relation queries the response was YES. [2023-08-30 20:27:31,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38446 conditions, 9780 events. 6863/9780 cut-off events. For 31304/32506 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 50432 event pairs, 996 based on Foata normal form. 1198/10100 useless extension candidates. Maximal degree in co-relation 38412. Up to 6365 conditions per place. [2023-08-30 20:27:31,972 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 92 selfloop transitions, 4 changer transitions 100/197 dead transitions. [2023-08-30 20:27:31,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 197 transitions, 1789 flow [2023-08-30 20:27:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:27:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:27:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2023-08-30 20:27:31,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013513513513513 [2023-08-30 20:27:31,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2023-08-30 20:27:31,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2023-08-30 20:27:31,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:31,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2023-08-30 20:27:31,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:31,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:31,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:31,981 INFO L175 Difference]: Start difference. First operand has 70 places, 88 transitions, 595 flow. Second operand 5 states and 742 transitions. [2023-08-30 20:27:31,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 197 transitions, 1789 flow [2023-08-30 20:27:32,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 197 transitions, 1684 flow, removed 40 selfloop flow, removed 3 redundant places. [2023-08-30 20:27:32,127 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 494 flow [2023-08-30 20:27:32,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2023-08-30 20:27:32,130 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-08-30 20:27:32,130 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 494 flow [2023-08-30 20:27:32,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:32,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:32,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 20:27:32,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:32,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1508571068, now seen corresponding path program 5 times [2023-08-30 20:27:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:32,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926053578] [2023-08-30 20:27:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:27:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:32,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926053578] [2023-08-30 20:27:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926053578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:27:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341133807] [2023-08-30 20:27:32,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:27:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:32,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:27:32,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:27:32,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 20:27:32,923 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 20:27:32,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:27:32,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 20:27:32,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:27:33,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-30 20:27:33,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:27:33,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:27:33,164 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 15 treesize of output 7 [2023-08-30 20:27:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:33,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:27:33,544 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_thread2Thread1of1ForFork3_~i~1)))) (and (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_385 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_385) c_~A~0.base))) (or (<= (select .cse0 c_~A~0.offset) (+ c_~max~0 1)) (<= c_~max~0 (select .cse0 .cse1)))))) (forall ((v_ArrVal_385 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_385) c_~A~0.base))) (let ((.cse3 (select .cse2 .cse1))) (or (<= (select .cse2 c_~A~0.offset) (+ .cse3 1)) (<= 2147483647 .cse3) (< .cse3 c_~max~0))))))) is different from false [2023-08-30 20:27:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341133807] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:27:33,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:27:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 8] total 28 [2023-08-30 20:27:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911724662] [2023-08-30 20:27:33,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:27:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 20:27:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 20:27:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=634, Unknown=1, NotChecked=52, Total=812 [2023-08-30 20:27:33,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-08-30 20:27:33,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 494 flow. Second operand has 29 states, 29 states have (on average 103.20689655172414) internal successors, (2993), 29 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:33,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:33,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-08-30 20:27:33,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:41,328 INFO L130 PetriNetUnfolder]: 30257/41817 cut-off events. [2023-08-30 20:27:41,328 INFO L131 PetriNetUnfolder]: For 162503/162503 co-relation queries the response was YES. [2023-08-30 20:27:41,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169293 conditions, 41817 events. 30257/41817 cut-off events. For 162503/162503 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 246153 event pairs, 2351 based on Foata normal form. 28/38545 useless extension candidates. Maximal degree in co-relation 169258. Up to 10235 conditions per place. [2023-08-30 20:27:41,513 INFO L137 encePairwiseOnDemand]: 276/296 looper letters, 399 selfloop transitions, 197 changer transitions 1048/1644 dead transitions. [2023-08-30 20:27:41,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1644 transitions, 12718 flow [2023-08-30 20:27:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-08-30 20:27:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-08-30 20:27:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 9280 transitions. [2023-08-30 20:27:41,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3823335530652604 [2023-08-30 20:27:41,530 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 9280 transitions. [2023-08-30 20:27:41,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 9280 transitions. [2023-08-30 20:27:41,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:41,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 9280 transitions. [2023-08-30 20:27:41,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 113.17073170731707) internal successors, (9280), 82 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:41,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 296.0) internal successors, (24568), 83 states have internal predecessors, (24568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:41,582 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 296.0) internal successors, (24568), 83 states have internal predecessors, (24568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:41,582 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 494 flow. Second operand 82 states and 9280 transitions. [2023-08-30 20:27:41,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1644 transitions, 12718 flow [2023-08-30 20:27:42,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1644 transitions, 12256 flow, removed 172 selfloop flow, removed 5 redundant places. [2023-08-30 20:27:42,442 INFO L231 Difference]: Finished difference. Result has 211 places, 278 transitions, 3003 flow [2023-08-30 20:27:42,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=3003, PETRI_PLACES=211, PETRI_TRANSITIONS=278} [2023-08-30 20:27:42,443 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-08-30 20:27:42,443 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 278 transitions, 3003 flow [2023-08-30 20:27:42,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 103.20689655172414) internal successors, (2993), 29 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:42,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:27:42,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:27:42,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 20:27:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:42,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:27:42,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:27:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 957774916, now seen corresponding path program 6 times [2023-08-30 20:27:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:27:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955019883] [2023-08-30 20:27:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:27:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:27:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:27:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:27:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:27:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955019883] [2023-08-30 20:27:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955019883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:27:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184318501] [2023-08-30 20:27:43,168 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:27:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:27:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:27:43,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:27:43,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 20:27:43,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 20:27:43,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:27:43,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 20:27:43,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:27:43,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-30 20:27:43,699 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 17 treesize of output 9 [2023-08-30 20:27:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:43,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:27:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:27:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184318501] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:27:44,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:27:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 22 [2023-08-30 20:27:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543139121] [2023-08-30 20:27:44,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:27:44,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 20:27:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:27:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 20:27:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-08-30 20:27:44,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 296 [2023-08-30 20:27:44,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 278 transitions, 3003 flow. Second operand has 23 states, 23 states have (on average 124.43478260869566) internal successors, (2862), 23 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:44,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:27:44,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 296 [2023-08-30 20:27:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:27:57,888 INFO L130 PetriNetUnfolder]: 42315/59435 cut-off events. [2023-08-30 20:27:57,889 INFO L131 PetriNetUnfolder]: For 3868427/3868427 co-relation queries the response was YES. [2023-08-30 20:27:58,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589763 conditions, 59435 events. 42315/59435 cut-off events. For 3868427/3868427 co-relation queries the response was YES. Maximal size of possible extension queue 2091. Compared 379928 event pairs, 6505 based on Foata normal form. 33/59467 useless extension candidates. Maximal degree in co-relation 589664. Up to 27235 conditions per place. [2023-08-30 20:27:58,975 INFO L137 encePairwiseOnDemand]: 282/296 looper letters, 576 selfloop transitions, 338 changer transitions 726/1640 dead transitions. [2023-08-30 20:27:58,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1640 transitions, 25449 flow [2023-08-30 20:27:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-08-30 20:27:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-08-30 20:27:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 8695 transitions. [2023-08-30 20:27:58,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2023-08-30 20:27:58,986 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 8695 transitions. [2023-08-30 20:27:58,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 8695 transitions. [2023-08-30 20:27:58,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:27:58,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 8695 transitions. [2023-08-30 20:27:58,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 133.76923076923077) internal successors, (8695), 65 states have internal predecessors, (8695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:59,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 296.0) internal successors, (19536), 66 states have internal predecessors, (19536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:59,017 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 296.0) internal successors, (19536), 66 states have internal predecessors, (19536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:27:59,017 INFO L175 Difference]: Start difference. First operand has 211 places, 278 transitions, 3003 flow. Second operand 65 states and 8695 transitions. [2023-08-30 20:27:59,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 1640 transitions, 25449 flow [2023-08-30 20:28:09,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1640 transitions, 19519 flow, removed 2963 selfloop flow, removed 44 redundant places. [2023-08-30 20:28:09,681 INFO L231 Difference]: Finished difference. Result has 225 places, 558 transitions, 7232 flow [2023-08-30 20:28:09,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=7232, PETRI_PLACES=225, PETRI_TRANSITIONS=558} [2023-08-30 20:28:09,682 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 185 predicate places. [2023-08-30 20:28:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 558 transitions, 7232 flow [2023-08-30 20:28:09,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 124.43478260869566) internal successors, (2862), 23 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:09,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:28:09,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:28:09,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 20:28:09,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:28:09,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:28:09,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:28:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1014827836, now seen corresponding path program 7 times [2023-08-30 20:28:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:28:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583491636] [2023-08-30 20:28:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:28:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:28:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:28:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:28:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:28:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583491636] [2023-08-30 20:28:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583491636] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:28:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630343931] [2023-08-30 20:28:10,277 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:28:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:28:10,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:28:10,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:28:10,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 20:28:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:28:10,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 20:28:10,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:28:10,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-30 20:28:10,573 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 17 treesize of output 9 [2023-08-30 20:28:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:28:10,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:28:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:28:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630343931] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:28:10,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:28:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 25 [2023-08-30 20:28:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453513696] [2023-08-30 20:28:10,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:28:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 20:28:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:28:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 20:28:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-08-30 20:28:11,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 296 [2023-08-30 20:28:11,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 558 transitions, 7232 flow. Second operand has 26 states, 26 states have (on average 124.15384615384616) internal successors, (3228), 26 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:11,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:28:11,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 296 [2023-08-30 20:28:11,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:28:32,088 INFO L130 PetriNetUnfolder]: 64763/91287 cut-off events. [2023-08-30 20:28:32,088 INFO L131 PetriNetUnfolder]: For 3687733/3687733 co-relation queries the response was YES. [2023-08-30 20:28:33,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750693 conditions, 91287 events. 64763/91287 cut-off events. For 3687733/3687733 co-relation queries the response was YES. Maximal size of possible extension queue 3314. Compared 620871 event pairs, 12176 based on Foata normal form. 100/91386 useless extension candidates. Maximal degree in co-relation 750588. Up to 41253 conditions per place. [2023-08-30 20:28:33,948 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 560 selfloop transitions, 393 changer transitions 1199/2152 dead transitions. [2023-08-30 20:28:33,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 2152 transitions, 32384 flow [2023-08-30 20:28:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-08-30 20:28:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-08-30 20:28:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 8934 transitions. [2023-08-30 20:28:33,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45048406615570796 [2023-08-30 20:28:33,959 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 8934 transitions. [2023-08-30 20:28:33,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 8934 transitions. [2023-08-30 20:28:33,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:28:33,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 8934 transitions. [2023-08-30 20:28:33,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 133.34328358208955) internal successors, (8934), 67 states have internal predecessors, (8934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:33,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 296.0) internal successors, (20128), 68 states have internal predecessors, (20128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:33,987 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 296.0) internal successors, (20128), 68 states have internal predecessors, (20128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:33,987 INFO L175 Difference]: Start difference. First operand has 225 places, 558 transitions, 7232 flow. Second operand 67 states and 8934 transitions. [2023-08-30 20:28:33,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 2152 transitions, 32384 flow [2023-08-30 20:28:58,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 2152 transitions, 30599 flow, removed 822 selfloop flow, removed 24 redundant places. [2023-08-30 20:28:58,299 INFO L231 Difference]: Finished difference. Result has 290 places, 730 transitions, 10728 flow [2023-08-30 20:28:58,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6769, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=10728, PETRI_PLACES=290, PETRI_TRANSITIONS=730} [2023-08-30 20:28:58,301 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 250 predicate places. [2023-08-30 20:28:58,301 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 730 transitions, 10728 flow [2023-08-30 20:28:58,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 124.15384615384616) internal successors, (3228), 26 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:28:58,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:28:58,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:28:58,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 20:28:58,507 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,SelfDestructingSolverStorable10 [2023-08-30 20:28:58,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:28:58,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:28:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1029139722, now seen corresponding path program 8 times [2023-08-30 20:28:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:28:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37350586] [2023-08-30 20:28:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:28:58,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:28:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:28:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:28:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:28:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37350586] [2023-08-30 20:28:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37350586] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:28:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226969343] [2023-08-30 20:28:59,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:28:59,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:28:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:28:59,220 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:28:59,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 20:28:59,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:28:59,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:28:59,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 20:28:59,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:28:59,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:28:59,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 20:28:59,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-30 20:28:59,717 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 17 treesize of output 9 [2023-08-30 20:28:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:28:59,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:29:00,177 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 41 treesize of output 33 [2023-08-30 20:29:00,180 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 5 treesize of output 3 [2023-08-30 20:29:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:29:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226969343] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:29:06,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:29:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2023-08-30 20:29:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063932284] [2023-08-30 20:29:06,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:29:06,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 20:29:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:29:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 20:29:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1101, Unknown=16, NotChecked=0, Total=1332 [2023-08-30 20:29:08,361 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-30 20:29:10,433 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-30 20:29:12,559 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-30 20:29:14,677 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-30 20:29:16,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:18,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:20,966 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-30 20:29:23,042 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-30 20:29:25,102 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-30 20:29:27,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:29,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:31,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:33,359 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-30 20:29:35,452 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-30 20:29:37,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:37,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 296 [2023-08-30 20:29:37,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 730 transitions, 10728 flow. Second operand has 37 states, 37 states have (on average 98.51351351351352) internal successors, (3645), 37 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:29:37,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:29:37,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 296 [2023-08-30 20:29:37,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:30:10,683 INFO L130 PetriNetUnfolder]: 65139/92052 cut-off events. [2023-08-30 20:30:10,684 INFO L131 PetriNetUnfolder]: For 9333437/9333437 co-relation queries the response was YES. [2023-08-30 20:30:12,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979423 conditions, 92052 events. 65139/92052 cut-off events. For 9333437/9333437 co-relation queries the response was YES. Maximal size of possible extension queue 3151. Compared 627831 event pairs, 9033 based on Foata normal form. 91/92142 useless extension candidates. Maximal degree in co-relation 979285. Up to 41347 conditions per place. [2023-08-30 20:30:13,249 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 526 selfloop transitions, 553 changer transitions 1413/2492 dead transitions. [2023-08-30 20:30:13,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 2492 transitions, 44660 flow [2023-08-30 20:30:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-08-30 20:30:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-08-30 20:30:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 10140 transitions. [2023-08-30 20:30:13,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36059743954480794 [2023-08-30 20:30:13,262 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 10140 transitions. [2023-08-30 20:30:13,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 10140 transitions. [2023-08-30 20:30:13,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:30:13,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 10140 transitions. [2023-08-30 20:30:13,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 106.73684210526316) internal successors, (10140), 95 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:30:13,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 296.0) internal successors, (28416), 96 states have internal predecessors, (28416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:30:13,300 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 296.0) internal successors, (28416), 96 states have internal predecessors, (28416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:30:13,300 INFO L175 Difference]: Start difference. First operand has 290 places, 730 transitions, 10728 flow. Second operand 95 states and 10140 transitions. [2023-08-30 20:30:13,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 2492 transitions, 44660 flow [2023-08-30 20:31:04,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 2492 transitions, 40181 flow, removed 2219 selfloop flow, removed 31 redundant places. [2023-08-30 20:31:04,239 INFO L231 Difference]: Finished difference. Result has 397 places, 874 transitions, 14933 flow [2023-08-30 20:31:04,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=9953, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=425, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=14933, PETRI_PLACES=397, PETRI_TRANSITIONS=874} [2023-08-30 20:31:04,240 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 357 predicate places. [2023-08-30 20:31:04,240 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 874 transitions, 14933 flow [2023-08-30 20:31:04,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 98.51351351351352) internal successors, (3645), 37 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:31:04,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:31:04,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:31:04,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 20:31:04,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:31:04,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 20:31:04,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:31:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1244078106, now seen corresponding path program 9 times [2023-08-30 20:31:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:31:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760669425] [2023-08-30 20:31:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:31:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:31:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:31:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:31:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:31:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760669425] [2023-08-30 20:31:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760669425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:31:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341594662] [2023-08-30 20:31:04,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:31:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:31:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:31:04,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:31:04,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 20:31:05,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 20:31:05,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:31:05,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 20:31:05,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:31:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:31:05,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 20:31:05,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-30 20:31:05,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:31:05,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-08-30 20:31:05,476 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 17 treesize of output 9 [2023-08-30 20:31:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:31:05,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:31:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:31:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341594662] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:31:12,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:31:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 31 [2023-08-30 20:31:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011909351] [2023-08-30 20:31:12,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:31:12,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 20:31:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:31:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 20:31:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=794, Unknown=8, NotChecked=0, Total=992 [2023-08-30 20:31:12,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 296 [2023-08-30 20:31:12,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 874 transitions, 14933 flow. Second operand has 32 states, 32 states have (on average 99.8125) internal successors, (3194), 32 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:31:12,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:31:12,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 296 [2023-08-30 20:31:12,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand