./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-send-receive.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-send-receive.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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --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 21:29:14,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 21:29:14,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 21:29:14,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 21:29:14,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 21:29:14,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 21:29:14,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 21:29:14,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 21:29:14,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 21:29:14,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 21:29:14,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 21:29:14,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 21:29:14,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 21:29:14,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 21:29:14,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 21:29:14,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 21:29:14,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 21:29:14,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 21:29:14,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 21:29:14,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 21:29:14,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 21:29:14,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 21:29:14,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 21:29:14,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 21:29:14,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 21:29:14,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 21:29:14,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 21:29:14,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 21:29:14,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 21:29:14,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 21:29:14,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 21:29:14,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 21:29:14,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 21:29:14,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 21:29:14,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 21:29:14,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 21:29:14,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 21:29:14,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 21:29:14,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 21:29:14,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 21:29:14,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 21:29:14,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 21:29:14,637 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 21:29:14,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 21:29:14,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 21:29:14,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 21:29:14,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 21:29:14,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 21:29:14,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 21:29:14,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 21:29:14,641 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 21:29:14,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 21:29:14,642 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 21:29:14,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 21:29:14,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 21:29:14,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 21:29:14,643 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 21:29:14,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 21:29:14,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 21:29:14,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 21:29:14,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 21:29:14,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 21:29:14,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 21:29:14,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 21:29:14,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 21:29:14,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 21:29:14,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 21:29:14,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 21:29:14,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 21:29:14,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 21:29:14,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 21:29:14,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 21:29:14,647 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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 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 21:29:14,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 21:29:14,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 21:29:14,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 21:29:14,953 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 21:29:14,954 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 21:29:14,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-30 21:29:16,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 21:29:16,244 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 21:29:16,245 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-30 21:29:16,253 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6f15db7/e8accca227a34fbb83c443cdad3f7604/FLAGc566ce9d9 [2023-08-30 21:29:16,263 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6f15db7/e8accca227a34fbb83c443cdad3f7604 [2023-08-30 21:29:16,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 21:29:16,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 21:29:16,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 21:29:16,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 21:29:16,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 21:29:16,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7326a5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16, skipping insertion in model container [2023-08-30 21:29:16,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 21:29:16,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 21:29:16,442 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-send-receive.wvr.c[3107,3120] [2023-08-30 21:29:16,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 21:29:16,455 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 21:29:16,473 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-send-receive.wvr.c[3107,3120] [2023-08-30 21:29:16,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 21:29:16,498 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 21:29:16,498 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 21:29:16,504 INFO L208 MainTranslator]: Completed translation [2023-08-30 21:29:16,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16 WrapperNode [2023-08-30 21:29:16,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 21:29:16,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 21:29:16,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 21:29:16,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 21:29:16,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,541 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-08-30 21:29:16,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 21:29:16,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 21:29:16,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 21:29:16,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 21:29:16,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 21:29:16,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 21:29:16,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 21:29:16,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 21:29:16,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (1/1) ... [2023-08-30 21:29:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 21:29:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:16,646 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 21:29:16,668 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 21:29:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 21:29:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 21:29:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 21:29:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 21:29:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 21:29:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 21:29:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 21:29:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 21:29:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 21:29:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 21:29:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 21:29:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 21:29:16,697 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 21:29:16,849 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 21:29:16,851 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 21:29:17,103 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 21:29:17,184 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 21:29:17,184 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 21:29:17,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:29:17 BoogieIcfgContainer [2023-08-30 21:29:17,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 21:29:17,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 21:29:17,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 21:29:17,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 21:29:17,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 09:29:16" (1/3) ... [2023-08-30 21:29:17,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c948d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:29:17, skipping insertion in model container [2023-08-30 21:29:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:29:16" (2/3) ... [2023-08-30 21:29:17,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c948d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:29:17, skipping insertion in model container [2023-08-30 21:29:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:29:17" (3/3) ... [2023-08-30 21:29:17,193 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-30 21:29:17,201 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 21:29:17,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 21:29:17,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 21:29:17,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 21:29:17,272 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 21:29:17,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-08-30 21:29:17,364 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-08-30 21:29:17,365 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 21:29:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 21:29:17,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-08-30 21:29:17,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-08-30 21:29:17,377 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 21:29:17,385 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-08-30 21:29:17,387 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-08-30 21:29:17,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-08-30 21:29:17,440 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-08-30 21:29:17,440 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 21:29:17,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 10/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-08-30 21:29:17,453 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-08-30 21:29:21,813 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-08-30 21:29:21,814 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 21:29:21,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 21:29:21,832 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;@4ac13742, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 21:29:21,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 21:29:21,840 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-08-30 21:29:21,840 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 21:29:21,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:21,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:29:21,841 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 1 more)] === [2023-08-30 21:29:21,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-08-30 21:29:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678507396] [2023-08-30 21:29:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:22,252 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 21:29:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678507396] [2023-08-30 21:29:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678507396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:29:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:29:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:29:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511756877] [2023-08-30 21:29:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:29:22,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:29:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:29:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:29:22,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-30 21:29:22,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 21:29:22,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:22,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-30 21:29:22,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:22,470 INFO L130 PetriNetUnfolder]: 142/245 cut-off events. [2023-08-30 21:29:22,471 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-30 21:29:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 245 events. 142/245 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 933 event pairs, 10 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 412. Up to 89 conditions per place. [2023-08-30 21:29:22,480 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 40 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-30 21:29:22,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 214 flow [2023-08-30 21:29:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 21:29:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 21:29:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-30 21:29:22,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2023-08-30 21:29:22,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-30 21:29:22,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-30 21:29:22,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:22,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-30 21:29:22,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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 21:29:22,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 21:29:22,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 21:29:22,522 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 612 transitions. [2023-08-30 21:29:22,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 214 flow [2023-08-30 21:29:22,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 191 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 21:29:22,528 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-08-30 21:29:22,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-30 21:29:22,534 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-30 21:29:22,535 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-08-30 21:29:22,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 21:29:22,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:22,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:29:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 21:29:22,539 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 1 more)] === [2023-08-30 21:29:22,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 919484616, now seen corresponding path program 2 times [2023-08-30 21:29:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742823607] [2023-08-30 21:29:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:22,704 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 21:29:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742823607] [2023-08-30 21:29:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742823607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:29:22,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:29:22,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:29:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490221026] [2023-08-30 21:29:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:29:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:29:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:29:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:29:22,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-30 21:29:22,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 21:29:22,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:22,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-30 21:29:22,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:22,877 INFO L130 PetriNetUnfolder]: 186/318 cut-off events. [2023-08-30 21:29:22,877 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-08-30 21:29:22,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 318 events. 186/318 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1057 event pairs, 30 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 452. Up to 147 conditions per place. [2023-08-30 21:29:22,880 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-30 21:29:22,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 229 flow [2023-08-30 21:29:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 21:29:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 21:29:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-30 21:29:22,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2023-08-30 21:29:22,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-30 21:29:22,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-30 21:29:22,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:22,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-30 21:29:22,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 21:29:22,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 21:29:22,887 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 21:29:22,887 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 610 transitions. [2023-08-30 21:29:22,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 229 flow [2023-08-30 21:29:22,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 21:29:22,892 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-08-30 21:29:22,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-30 21:29:22,892 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-30 21:29:22,893 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-08-30 21:29:22,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 21:29:22,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:22,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:29:22,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 21:29:22,894 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 1 more)] === [2023-08-30 21:29:22,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-08-30 21:29:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:22,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395859454] [2023-08-30 21:29:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:23,080 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 21:29:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395859454] [2023-08-30 21:29:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395859454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:29:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:29:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 21:29:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200229091] [2023-08-30 21:29:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:29:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 21:29:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 21:29:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 21:29:23,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-08-30 21:29:23,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states 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 21:29:23,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:23,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-08-30 21:29:23,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:23,293 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2023-08-30 21:29:23,293 INFO L131 PetriNetUnfolder]: For 336/349 co-relation queries the response was YES. [2023-08-30 21:29:23,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 454 events. 256/454 cut-off events. For 336/349 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1907 event pairs, 29 based on Foata normal form. 29/476 useless extension candidates. Maximal degree in co-relation 904. Up to 126 conditions per place. [2023-08-30 21:29:23,295 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 44 selfloop transitions, 8 changer transitions 21/76 dead transitions. [2023-08-30 21:29:23,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 414 flow [2023-08-30 21:29:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 21:29:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 21:29:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-08-30 21:29:23,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2023-08-30 21:29:23,299 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-08-30 21:29:23,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-08-30 21:29:23,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:23,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-08-30 21:29:23,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 21:29:23,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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 21:29:23,305 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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 21:29:23,305 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 852 transitions. [2023-08-30 21:29:23,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 414 flow [2023-08-30 21:29:23,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 21:29:23,310 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-08-30 21:29:23,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-30 21:29:23,312 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-08-30 21:29:23,314 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-08-30 21:29:23,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states 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 21:29:23,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:23,315 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] [2023-08-30 21:29:23,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 21:29:23,316 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 1 more)] === [2023-08-30 21:29:23,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1817089691, now seen corresponding path program 1 times [2023-08-30 21:29:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964829142] [2023-08-30 21:29:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:23,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:23,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964829142] [2023-08-30 21:29:23,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964829142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:29:23,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:29:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 21:29:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618078817] [2023-08-30 21:29:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:29:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 21:29:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 21:29:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 21:29:23,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-30 21:29:23,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 21:29:23,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:23,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-30 21:29:23,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:23,518 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-08-30 21:29:23,518 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-08-30 21:29:23,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 163 events. 80/163 cut-off events. For 323/336 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 457 event pairs, 15 based on Foata normal form. 23/181 useless extension candidates. Maximal degree in co-relation 508. Up to 121 conditions per place. [2023-08-30 21:29:23,520 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-30 21:29:23,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-08-30 21:29:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 21:29:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 21:29:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-30 21:29:23,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494579945799458 [2023-08-30 21:29:23,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-30 21:29:23,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-30 21:29:23,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:23,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-30 21:29:23,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 21:29:23,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 21:29:23,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 21:29:23,525 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 365 transitions. [2023-08-30 21:29:23,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-08-30 21:29:23,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-30 21:29:23,527 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-08-30 21:29:23,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-30 21:29:23,528 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-30 21:29:23,528 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-08-30 21:29:23,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 21:29:23,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:23,529 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] [2023-08-30 21:29:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 21:29:23,530 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 1 more)] === [2023-08-30 21:29:23,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-08-30 21:29:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667196180] [2023-08-30 21:29:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:23,666 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 21:29:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667196180] [2023-08-30 21:29:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667196180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:29:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:29:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:29:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205786895] [2023-08-30 21:29:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:29:23,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:29:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:29:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:29:23,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-30 21:29:23,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 21:29:23,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:23,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-30 21:29:23,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:23,769 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-08-30 21:29:23,770 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-08-30 21:29:23,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 178 events. 83/178 cut-off events. For 228/250 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 40 based on Foata normal form. 26/197 useless extension candidates. Maximal degree in co-relation 547. Up to 137 conditions per place. [2023-08-30 21:29:23,771 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-08-30 21:29:23,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-08-30 21:29:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:29:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:29:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-30 21:29:23,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49085365853658536 [2023-08-30 21:29:23,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-30 21:29:23,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-30 21:29:23,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:23,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-30 21:29:23,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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 21:29:23,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 21:29:23,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 21:29:23,777 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 483 transitions. [2023-08-30 21:29:23,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-08-30 21:29:23,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 21:29:23,779 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-08-30 21:29:23,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 21:29:23,780 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-30 21:29:23,780 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-08-30 21:29:23,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 21:29:23,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:23,781 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] [2023-08-30 21:29:23,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 21:29:23,781 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 1 more)] === [2023-08-30 21:29:23,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-08-30 21:29:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344610819] [2023-08-30 21:29:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344610819] [2023-08-30 21:29:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344610819] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174036624] [2023-08-30 21:29:24,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:24,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:24,513 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 21:29:24,520 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 21:29:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:24,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-30 21:29:24,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:24,738 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 21:29:24,810 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 21:29:24,882 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 21:29:24,947 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 21:29:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:25,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:25,711 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-08-30 21:29:25,816 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-08-30 21:29:25,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:25,866 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 68 treesize of output 56 [2023-08-30 21:29:25,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:25,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 620 [2023-08-30 21:29:25,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:25,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 280 [2023-08-30 21:29:25,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:25,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 201 [2023-08-30 21:29:25,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:25,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 220 [2023-08-30 21:29:26,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:26,699 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 68 treesize of output 56 [2023-08-30 21:29:26,713 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:26,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 616 [2023-08-30 21:29:26,761 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:26,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 252 [2023-08-30 21:29:26,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:29:26,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-08-30 21:29:26,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:26,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 161 [2023-08-30 21:29:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 21:29:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174036624] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:27,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-08-30 21:29:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646880955] [2023-08-30 21:29:27,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:27,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 21:29:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:27,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 21:29:27,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=616, Unknown=5, NotChecked=106, Total=870 [2023-08-30 21:29:27,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-30 21:29:27,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 120 flow. Second operand has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states 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 21:29:27,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:27,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-30 21:29:27,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:34,443 INFO L130 PetriNetUnfolder]: 1286/2153 cut-off events. [2023-08-30 21:29:34,443 INFO L131 PetriNetUnfolder]: For 2109/2109 co-relation queries the response was YES. [2023-08-30 21:29:34,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6714 conditions, 2153 events. 1286/2153 cut-off events. For 2109/2109 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10640 event pairs, 25 based on Foata normal form. 126/2275 useless extension candidates. Maximal degree in co-relation 6701. Up to 423 conditions per place. [2023-08-30 21:29:34,455 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 294 selfloop transitions, 173 changer transitions 25/492 dead transitions. [2023-08-30 21:29:34,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 492 transitions, 2839 flow [2023-08-30 21:29:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-08-30 21:29:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-08-30 21:29:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 6068 transitions. [2023-08-30 21:29:34,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2023-08-30 21:29:34,477 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 6068 transitions. [2023-08-30 21:29:34,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 6068 transitions. [2023-08-30 21:29:34,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:34,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 6068 transitions. [2023-08-30 21:29:34,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 67.42222222222222) internal successors, (6068), 90 states have internal predecessors, (6068), 0 states have call successors, (0), 0 states 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 21:29:34,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 0 states 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 21:29:34,533 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 0 states have call successors, (0), 0 states 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 21:29:34,534 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 90 states and 6068 transitions. [2023-08-30 21:29:34,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 492 transitions, 2839 flow [2023-08-30 21:29:34,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 492 transitions, 2801 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-30 21:29:34,547 INFO L231 Difference]: Finished difference. Result has 162 places, 215 transitions, 1574 flow [2023-08-30 21:29:34,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=1574, PETRI_PLACES=162, PETRI_TRANSITIONS=215} [2023-08-30 21:29:34,550 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2023-08-30 21:29:34,550 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 215 transitions, 1574 flow [2023-08-30 21:29:34,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states 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 21:29:34,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:34,552 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] [2023-08-30 21:29:34,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 21:29:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-30 21:29:34,760 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 1 more)] === [2023-08-30 21:29:34,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-08-30 21:29:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297880554] [2023-08-30 21:29:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:35,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297880554] [2023-08-30 21:29:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297880554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84805222] [2023-08-30 21:29:35,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 21:29:35,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:35,553 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 21:29:35,578 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 21:29:35,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 21:29:35,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:29:35,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-30 21:29:35,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:35,783 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 21:29:35,842 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 21:29:35,900 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 21:29:36,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:29:36,069 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 21:29:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:36,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:36,288 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0))))))) is different from false [2023-08-30 21:29:36,343 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2))))))) is different from false [2023-08-30 21:29:36,368 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-08-30 21:29:36,391 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-08-30 21:29:36,449 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-08-30 21:29:36,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:36,659 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 65 treesize of output 53 [2023-08-30 21:29:36,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:36,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 484 treesize of output 460 [2023-08-30 21:29:36,702 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 152 treesize of output 128 [2023-08-30 21:29:36,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:36,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 122 [2023-08-30 21:29:36,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:36,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 109 [2023-08-30 21:29:37,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:37,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-30 21:29:37,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:29:37,061 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:37,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2023-08-30 21:29:37,072 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:37,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 112 [2023-08-30 21:29:37,083 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 21:29:37,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2023-08-30 21:29:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 21:29:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84805222] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:37,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:37,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-08-30 21:29:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374257855] [2023-08-30 21:29:37,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:37,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 21:29:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 21:29:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2023-08-30 21:29:37,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-30 21:29:37,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 215 transitions, 1574 flow. Second operand has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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 21:29:37,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:37,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-30 21:29:37,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:38,289 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-08-30 21:29:38,688 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4))))))) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-08-30 21:29:40,587 INFO L130 PetriNetUnfolder]: 1467/2438 cut-off events. [2023-08-30 21:29:40,587 INFO L131 PetriNetUnfolder]: For 71043/71043 co-relation queries the response was YES. [2023-08-30 21:29:40,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16181 conditions, 2438 events. 1467/2438 cut-off events. For 71043/71043 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11984 event pairs, 96 based on Foata normal form. 124/2560 useless extension candidates. Maximal degree in co-relation 16135. Up to 538 conditions per place. [2023-08-30 21:29:40,612 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 234 selfloop transitions, 168 changer transitions 111/513 dead transitions. [2023-08-30 21:29:40,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 513 transitions, 5566 flow [2023-08-30 21:29:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-30 21:29:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-30 21:29:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3986 transitions. [2023-08-30 21:29:40,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2746313903817004 [2023-08-30 21:29:40,622 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3986 transitions. [2023-08-30 21:29:40,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3986 transitions. [2023-08-30 21:29:40,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:40,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3986 transitions. [2023-08-30 21:29:40,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 67.55932203389831) internal successors, (3986), 59 states have internal predecessors, (3986), 0 states have call successors, (0), 0 states 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 21:29:40,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 0 states have call successors, (0), 0 states 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 21:29:40,653 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 0 states have call successors, (0), 0 states 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 21:29:40,654 INFO L175 Difference]: Start difference. First operand has 162 places, 215 transitions, 1574 flow. Second operand 59 states and 3986 transitions. [2023-08-30 21:29:40,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 513 transitions, 5566 flow [2023-08-30 21:29:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 513 transitions, 4843 flow, removed 251 selfloop flow, removed 13 redundant places. [2023-08-30 21:29:40,827 INFO L231 Difference]: Finished difference. Result has 234 places, 256 transitions, 2455 flow [2023-08-30 21:29:40,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2455, PETRI_PLACES=234, PETRI_TRANSITIONS=256} [2023-08-30 21:29:40,829 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2023-08-30 21:29:40,829 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 256 transitions, 2455 flow [2023-08-30 21:29:40,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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 21:29:40,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:40,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 21:29:40,837 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 21:29:41,036 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 21:29:41,037 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 1 more)] === [2023-08-30 21:29:41,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1053388881, now seen corresponding path program 3 times [2023-08-30 21:29:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937670385] [2023-08-30 21:29:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937670385] [2023-08-30 21:29:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937670385] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430542201] [2023-08-30 21:29:41,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:29:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:41,921 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 21:29:41,936 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 21:29:42,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 21:29:42,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:29:42,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 21:29:42,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:29:42,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:42,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:42,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 44 [2023-08-30 21:29:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:29:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430542201] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:42,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2023-08-30 21:29:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800427797] [2023-08-30 21:29:42,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 21:29:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 21:29:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-08-30 21:29:43,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 246 [2023-08-30 21:29:43,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 256 transitions, 2455 flow. Second operand has 25 states, 25 states have (on average 88.36) internal successors, (2209), 25 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states 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 21:29:43,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:43,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 246 [2023-08-30 21:29:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:45,187 INFO L130 PetriNetUnfolder]: 1574/2651 cut-off events. [2023-08-30 21:29:45,187 INFO L131 PetriNetUnfolder]: For 147856/147856 co-relation queries the response was YES. [2023-08-30 21:29:45,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21894 conditions, 2651 events. 1574/2651 cut-off events. For 147856/147856 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13619 event pairs, 80 based on Foata normal form. 32/2682 useless extension candidates. Maximal degree in co-relation 21827. Up to 688 conditions per place. [2023-08-30 21:29:45,222 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 236 selfloop transitions, 153 changer transitions 60/449 dead transitions. [2023-08-30 21:29:45,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 449 transitions, 5322 flow [2023-08-30 21:29:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 21:29:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 21:29:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3212 transitions. [2023-08-30 21:29:45,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373054587688734 [2023-08-30 21:29:45,228 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3212 transitions. [2023-08-30 21:29:45,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3212 transitions. [2023-08-30 21:29:45,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:45,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3212 transitions. [2023-08-30 21:29:45,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 91.77142857142857) internal successors, (3212), 35 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states 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 21:29:45,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states 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 21:29:45,245 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states 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 21:29:45,246 INFO L175 Difference]: Start difference. First operand has 234 places, 256 transitions, 2455 flow. Second operand 35 states and 3212 transitions. [2023-08-30 21:29:45,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 449 transitions, 5322 flow [2023-08-30 21:29:45,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 449 transitions, 4630 flow, removed 303 selfloop flow, removed 29 redundant places. [2023-08-30 21:29:45,741 INFO L231 Difference]: Finished difference. Result has 235 places, 287 transitions, 2888 flow [2023-08-30 21:29:45,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2888, PETRI_PLACES=235, PETRI_TRANSITIONS=287} [2023-08-30 21:29:45,742 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2023-08-30 21:29:45,742 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 287 transitions, 2888 flow [2023-08-30 21:29:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 88.36) internal successors, (2209), 25 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states 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 21:29:45,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:45,744 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 21:29:45,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 21:29:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:45,950 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 1 more)] === [2023-08-30 21:29:45,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash 238639103, now seen corresponding path program 4 times [2023-08-30 21:29:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046334248] [2023-08-30 21:29:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:46,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:46,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046334248] [2023-08-30 21:29:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046334248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821219877] [2023-08-30 21:29:46,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 21:29:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:46,802 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 21:29:46,829 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 21:29:46,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 21:29:46,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:29:46,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 21:29:46,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:47,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:29:47,121 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 18 treesize of output 20 [2023-08-30 21:29:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:29:47,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:47,348 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-08-30 21:29:47,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:47,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 86 [2023-08-30 21:29:47,383 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 53 treesize of output 47 [2023-08-30 21:29:47,388 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 47 treesize of output 41 [2023-08-30 21:29:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:29:47,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821219877] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:47,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-08-30 21:29:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298580600] [2023-08-30 21:29:47,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:47,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 21:29:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 21:29:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2023-08-30 21:29:47,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-08-30 21:29:47,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 287 transitions, 2888 flow. Second operand has 29 states, 29 states have (on average 70.10344827586206) internal successors, (2033), 29 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states 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 21:29:47,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:47,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-08-30 21:29:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:52,128 INFO L130 PetriNetUnfolder]: 1666/2784 cut-off events. [2023-08-30 21:29:52,128 INFO L131 PetriNetUnfolder]: For 155899/155899 co-relation queries the response was YES. [2023-08-30 21:29:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23896 conditions, 2784 events. 1666/2784 cut-off events. For 155899/155899 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14330 event pairs, 103 based on Foata normal form. 42/2826 useless extension candidates. Maximal degree in co-relation 23826. Up to 750 conditions per place. [2023-08-30 21:29:52,157 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 223 selfloop transitions, 202 changer transitions 37/462 dead transitions. [2023-08-30 21:29:52,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 462 transitions, 5830 flow [2023-08-30 21:29:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-30 21:29:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-30 21:29:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2798 transitions. [2023-08-30 21:29:52,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29931536157466837 [2023-08-30 21:29:52,162 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2798 transitions. [2023-08-30 21:29:52,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2798 transitions. [2023-08-30 21:29:52,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:52,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2798 transitions. [2023-08-30 21:29:52,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 73.63157894736842) internal successors, (2798), 38 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states 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 21:29:52,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 246.0) internal successors, (9594), 39 states have internal predecessors, (9594), 0 states have call successors, (0), 0 states 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 21:29:52,177 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 246.0) internal successors, (9594), 39 states have internal predecessors, (9594), 0 states have call successors, (0), 0 states 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 21:29:52,177 INFO L175 Difference]: Start difference. First operand has 235 places, 287 transitions, 2888 flow. Second operand 38 states and 2798 transitions. [2023-08-30 21:29:52,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 462 transitions, 5830 flow [2023-08-30 21:29:52,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 462 transitions, 5107 flow, removed 264 selfloop flow, removed 17 redundant places. [2023-08-30 21:29:52,613 INFO L231 Difference]: Finished difference. Result has 257 places, 316 transitions, 3239 flow [2023-08-30 21:29:52,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=3239, PETRI_PLACES=257, PETRI_TRANSITIONS=316} [2023-08-30 21:29:52,614 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 226 predicate places. [2023-08-30 21:29:52,614 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 316 transitions, 3239 flow [2023-08-30 21:29:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 70.10344827586206) internal successors, (2033), 29 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states 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 21:29:52,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:52,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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 21:29:52,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 21:29:52,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:52,816 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 1 more)] === [2023-08-30 21:29:52,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2047561495, now seen corresponding path program 5 times [2023-08-30 21:29:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857270628] [2023-08-30 21:29:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857270628] [2023-08-30 21:29:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857270628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782283144] [2023-08-30 21:29:53,023 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 21:29:53,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:53,024 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 21:29:53,048 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 21:29:53,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-30 21:29:53,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:29:53,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 21:29:53,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:53,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782283144] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:53,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-08-30 21:29:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692059816] [2023-08-30 21:29:53,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 21:29:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 21:29:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-08-30 21:29:53,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-08-30 21:29:53,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 316 transitions, 3239 flow. Second operand has 14 states, 14 states have (on average 109.85714285714286) internal successors, (1538), 14 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states 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 21:29:53,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:53,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-08-30 21:29:53,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:53,930 INFO L130 PetriNetUnfolder]: 778/1476 cut-off events. [2023-08-30 21:29:53,931 INFO L131 PetriNetUnfolder]: For 104590/104647 co-relation queries the response was YES. [2023-08-30 21:29:53,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14444 conditions, 1476 events. 778/1476 cut-off events. For 104590/104647 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8123 event pairs, 93 based on Foata normal form. 65/1473 useless extension candidates. Maximal degree in co-relation 14373. Up to 823 conditions per place. [2023-08-30 21:29:53,949 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 127 selfloop transitions, 25 changer transitions 45/257 dead transitions. [2023-08-30 21:29:53,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 257 transitions, 2979 flow [2023-08-30 21:29:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 21:29:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 21:29:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2023-08-30 21:29:53,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-30 21:29:53,952 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 902 transitions. [2023-08-30 21:29:53,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions. [2023-08-30 21:29:53,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:53,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions. [2023-08-30 21:29:53,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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 21:29:53,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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 21:29:53,955 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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 21:29:53,955 INFO L175 Difference]: Start difference. First operand has 257 places, 316 transitions, 3239 flow. Second operand 8 states and 902 transitions. [2023-08-30 21:29:53,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 257 transitions, 2979 flow [2023-08-30 21:29:54,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 257 transitions, 2643 flow, removed 68 selfloop flow, removed 41 redundant places. [2023-08-30 21:29:54,178 INFO L231 Difference]: Finished difference. Result has 202 places, 209 transitions, 1911 flow [2023-08-30 21:29:54,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=202, PETRI_TRANSITIONS=209} [2023-08-30 21:29:54,179 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2023-08-30 21:29:54,180 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 209 transitions, 1911 flow [2023-08-30 21:29:54,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.85714285714286) internal successors, (1538), 14 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states 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 21:29:54,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:54,180 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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 21:29:54,187 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 21:29:54,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-30 21:29:54,387 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 1 more)] === [2023-08-30 21:29:54,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1748716820, now seen corresponding path program 6 times [2023-08-30 21:29:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006138596] [2023-08-30 21:29:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:29:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:29:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:29:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006138596] [2023-08-30 21:29:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006138596] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:29:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951628224] [2023-08-30 21:29:55,867 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 21:29:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:29:55,868 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 21:29:55,869 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 21:29:55,972 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-30 21:29:55,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:29:55,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 21:29:55,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:29:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:29:56,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:29:56,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:29:56,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 44 [2023-08-30 21:29:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 21:29:56,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951628224] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:29:56,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:29:56,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 25 [2023-08-30 21:29:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676443637] [2023-08-30 21:29:56,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:29:56,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 21:29:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:29:56,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 21:29:56,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-08-30 21:29:57,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 246 [2023-08-30 21:29:57,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 209 transitions, 1911 flow. Second operand has 26 states, 26 states have (on average 82.46153846153847) internal successors, (2144), 26 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states 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 21:29:57,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:29:57,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 246 [2023-08-30 21:29:57,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:29:59,606 INFO L130 PetriNetUnfolder]: 1111/1858 cut-off events. [2023-08-30 21:29:59,606 INFO L131 PetriNetUnfolder]: For 39985/39985 co-relation queries the response was YES. [2023-08-30 21:29:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13951 conditions, 1858 events. 1111/1858 cut-off events. For 39985/39985 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8979 event pairs, 15 based on Foata normal form. 42/1900 useless extension candidates. Maximal degree in co-relation 13894. Up to 586 conditions per place. [2023-08-30 21:29:59,621 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 166 selfloop transitions, 148 changer transitions 37/351 dead transitions. [2023-08-30 21:29:59,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 351 transitions, 4056 flow [2023-08-30 21:29:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-30 21:29:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-30 21:29:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2821 transitions. [2023-08-30 21:29:59,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34749938408474995 [2023-08-30 21:29:59,627 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2821 transitions. [2023-08-30 21:29:59,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2821 transitions. [2023-08-30 21:29:59,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:29:59,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2821 transitions. [2023-08-30 21:29:59,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 85.48484848484848) internal successors, (2821), 33 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states 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 21:29:59,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 246.0) internal successors, (8364), 34 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states 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 21:29:59,639 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 246.0) internal successors, (8364), 34 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states 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 21:29:59,639 INFO L175 Difference]: Start difference. First operand has 202 places, 209 transitions, 1911 flow. Second operand 33 states and 2821 transitions. [2023-08-30 21:29:59,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 351 transitions, 4056 flow [2023-08-30 21:29:59,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 351 transitions, 3820 flow, removed 92 selfloop flow, removed 12 redundant places. [2023-08-30 21:29:59,718 INFO L231 Difference]: Finished difference. Result has 203 places, 225 transitions, 2418 flow [2023-08-30 21:29:59,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2418, PETRI_PLACES=203, PETRI_TRANSITIONS=225} [2023-08-30 21:29:59,719 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2023-08-30 21:29:59,719 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 225 transitions, 2418 flow [2023-08-30 21:29:59,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 82.46153846153847) internal successors, (2144), 26 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states 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 21:29:59,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:29:59,720 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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 21:29:59,732 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 21:29:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:29:59,926 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 1 more)] === [2023-08-30 21:29:59,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:29:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -274856926, now seen corresponding path program 7 times [2023-08-30 21:29:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:29:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143454695] [2023-08-30 21:29:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:29:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:29:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:30:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:30:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143454695] [2023-08-30 21:30:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143454695] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:30:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532054120] [2023-08-30 21:30:00,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 21:30:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:30:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:30:00,969 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 21:30:00,979 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 21:30:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:30:01,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 21:30:01,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:30:01,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:30:01,316 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 18 treesize of output 20 [2023-08-30 21:30:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 21:30:01,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:30:01,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:01,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 86 [2023-08-30 21:30:01,648 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 53 treesize of output 47 [2023-08-30 21:30:01,651 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 47 treesize of output 41 [2023-08-30 21:30:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 21:30:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532054120] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:30:01,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:30:01,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2023-08-30 21:30:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331008129] [2023-08-30 21:30:01,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:30:01,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 21:30:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:30:01,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 21:30:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=742, Unknown=10, NotChecked=0, Total=870 [2023-08-30 21:30:02,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-08-30 21:30:02,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 225 transitions, 2418 flow. Second operand has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states 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 21:30:02,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:30:02,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-08-30 21:30:02,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:30:03,869 INFO L130 PetriNetUnfolder]: 1161/1938 cut-off events. [2023-08-30 21:30:03,870 INFO L131 PetriNetUnfolder]: For 22842/22842 co-relation queries the response was YES. [2023-08-30 21:30:03,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13553 conditions, 1938 events. 1161/1938 cut-off events. For 22842/22842 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9309 event pairs, 67 based on Foata normal form. 42/1980 useless extension candidates. Maximal degree in co-relation 13500. Up to 622 conditions per place. [2023-08-30 21:30:03,885 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 170 selfloop transitions, 143 changer transitions 37/350 dead transitions. [2023-08-30 21:30:03,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 350 transitions, 4297 flow [2023-08-30 21:30:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 21:30:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 21:30:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2212 transitions. [2023-08-30 21:30:03,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2997289972899729 [2023-08-30 21:30:03,889 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2212 transitions. [2023-08-30 21:30:03,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2212 transitions. [2023-08-30 21:30:03,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:30:03,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2212 transitions. [2023-08-30 21:30:03,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 73.73333333333333) internal successors, (2212), 30 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states 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 21:30:03,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 246.0) internal successors, (7626), 31 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states 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 21:30:03,899 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 246.0) internal successors, (7626), 31 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states 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 21:30:03,899 INFO L175 Difference]: Start difference. First operand has 203 places, 225 transitions, 2418 flow. Second operand 30 states and 2212 transitions. [2023-08-30 21:30:03,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 350 transitions, 4297 flow [2023-08-30 21:30:04,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 350 transitions, 4007 flow, removed 29 selfloop flow, removed 17 redundant places. [2023-08-30 21:30:04,012 INFO L231 Difference]: Finished difference. Result has 217 places, 232 transitions, 2628 flow [2023-08-30 21:30:04,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2628, PETRI_PLACES=217, PETRI_TRANSITIONS=232} [2023-08-30 21:30:04,013 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2023-08-30 21:30:04,013 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 232 transitions, 2628 flow [2023-08-30 21:30:04,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states 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 21:30:04,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:30:04,014 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:30:04,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 21:30:04,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:30:04,220 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 1 more)] === [2023-08-30 21:30:04,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:30:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 988250302, now seen corresponding path program 8 times [2023-08-30 21:30:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:30:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449672920] [2023-08-30 21:30:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:30:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:30:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:30:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 21:30:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:30:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449672920] [2023-08-30 21:30:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449672920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 21:30:04,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 21:30:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 21:30:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380540675] [2023-08-30 21:30:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 21:30:04,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 21:30:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:30:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 21:30:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 21:30:04,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-08-30 21:30:04,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 232 transitions, 2628 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 21:30:04,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:30:04,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-08-30 21:30:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:30:04,866 INFO L130 PetriNetUnfolder]: 1570/2906 cut-off events. [2023-08-30 21:30:04,866 INFO L131 PetriNetUnfolder]: For 47060/47105 co-relation queries the response was YES. [2023-08-30 21:30:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20655 conditions, 2906 events. 1570/2906 cut-off events. For 47060/47105 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17769 event pairs, 219 based on Foata normal form. 110/2878 useless extension candidates. Maximal degree in co-relation 20602. Up to 1092 conditions per place. [2023-08-30 21:30:04,900 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 190 selfloop transitions, 83 changer transitions 0/339 dead transitions. [2023-08-30 21:30:04,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 339 transitions, 4482 flow [2023-08-30 21:30:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 21:30:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 21:30:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-30 21:30:04,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172764227642277 [2023-08-30 21:30:04,902 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-30 21:30:04,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-30 21:30:04,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:30:04,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-30 21:30:04,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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 21:30:04,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 21:30:04,905 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 21:30:04,905 INFO L175 Difference]: Start difference. First operand has 217 places, 232 transitions, 2628 flow. Second operand 4 states and 509 transitions. [2023-08-30 21:30:04,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 339 transitions, 4482 flow [2023-08-30 21:30:05,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 339 transitions, 4104 flow, removed 68 selfloop flow, removed 23 redundant places. [2023-08-30 21:30:05,009 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3681 flow [2023-08-30 21:30:05,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3681, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2023-08-30 21:30:05,009 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2023-08-30 21:30:05,009 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3681 flow [2023-08-30 21:30:05,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 21:30:05,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:30:05,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:30:05,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 21:30:05,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 21:30:05,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:30:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 279360084, now seen corresponding path program 9 times [2023-08-30 21:30:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:30:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312816199] [2023-08-30 21:30:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:30:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:30:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:30:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:30:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312816199] [2023-08-30 21:30:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312816199] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:30:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258281391] [2023-08-30 21:30:06,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 21:30:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:30:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:30:06,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:30:06,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 21:30:06,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 21:30:06,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:30:06,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 21:30:06,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:30:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:06,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:30:07,311 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-30 21:30:07,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 178 [2023-08-30 21:30:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258281391] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:30:08,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:30:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2023-08-30 21:30:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055669792] [2023-08-30 21:30:08,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:30:08,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 21:30:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:30:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 21:30:08,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2023-08-30 21:30:09,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 246 [2023-08-30 21:30:09,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 3681 flow. Second operand has 34 states, 34 states have (on average 87.17647058823529) internal successors, (2964), 34 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:30:09,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:30:09,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 246 [2023-08-30 21:30:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:30:20,840 INFO L130 PetriNetUnfolder]: 9271/15383 cut-off events. [2023-08-30 21:30:20,840 INFO L131 PetriNetUnfolder]: For 211621/211621 co-relation queries the response was YES. [2023-08-30 21:30:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110014 conditions, 15383 events. 9271/15383 cut-off events. For 211621/211621 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 104717 event pairs, 387 based on Foata normal form. 572/15955 useless extension candidates. Maximal degree in co-relation 109959. Up to 4507 conditions per place. [2023-08-30 21:30:20,962 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 794 selfloop transitions, 846 changer transitions 548/2188 dead transitions. [2023-08-30 21:30:20,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2188 transitions, 29162 flow [2023-08-30 21:30:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2023-08-30 21:30:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2023-08-30 21:30:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 13348 transitions. [2023-08-30 21:30:20,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37164494932620556 [2023-08-30 21:30:20,976 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 13348 transitions. [2023-08-30 21:30:20,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 13348 transitions. [2023-08-30 21:30:20,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:30:20,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 13348 transitions. [2023-08-30 21:30:20,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 147 states, 146 states have (on average 91.42465753424658) internal successors, (13348), 146 states have internal predecessors, (13348), 0 states have call successors, (0), 0 states 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 21:30:21,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 147 states, 147 states have (on average 246.0) internal successors, (36162), 147 states have internal predecessors, (36162), 0 states have call successors, (0), 0 states 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 21:30:21,033 INFO L81 ComplementDD]: Finished complementDD. Result has 147 states, 147 states have (on average 246.0) internal successors, (36162), 147 states have internal predecessors, (36162), 0 states have call successors, (0), 0 states 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 21:30:21,033 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3681 flow. Second operand 146 states and 13348 transitions. [2023-08-30 21:30:21,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2188 transitions, 29162 flow [2023-08-30 21:30:21,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 2188 transitions, 29070 flow, removed 46 selfloop flow, removed 0 redundant places. [2023-08-30 21:30:21,411 INFO L231 Difference]: Finished difference. Result has 396 places, 1034 transitions, 16521 flow [2023-08-30 21:30:21,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3633, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=16521, PETRI_PLACES=396, PETRI_TRANSITIONS=1034} [2023-08-30 21:30:21,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 365 predicate places. [2023-08-30 21:30:21,412 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1034 transitions, 16521 flow [2023-08-30 21:30:21,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 87.17647058823529) internal successors, (2964), 34 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:30:21,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:30:21,413 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:30:21,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 21:30:21,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-30 21:30:21,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 21:30:21,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:30:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -761636766, now seen corresponding path program 10 times [2023-08-30 21:30:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:30:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326796426] [2023-08-30 21:30:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:30:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:30:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:30:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:30:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326796426] [2023-08-30 21:30:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326796426] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:30:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429838843] [2023-08-30 21:30:22,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 21:30:22,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:30:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:30:22,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:30:22,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 21:30:22,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 21:30:22,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:30:22,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-30 21:30:22,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:30:22,829 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 18 treesize of output 16 [2023-08-30 21:30:22,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-30 21:30:22,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:30:23,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:30:23,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 21:30:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:23,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:30:24,364 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6)) (.cse3 (+ c_~queue~0.offset .cse7)) (.cse4 (+ c_~queue~0.offset .cse7 4)) (.cse2 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_573 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_573) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ (select .cse0 .cse2) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse3) (select .cse0 .cse4)))))) (forall ((v_ArrVal_573 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_573) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)) 1) (not (= (+ (select .cse5 .cse2) 1) 0)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0)) is different from false [2023-08-30 21:30:24,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:24,552 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 135 treesize of output 99 [2023-08-30 21:30:24,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:24,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2306 treesize of output 2206 [2023-08-30 21:30:24,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:24,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 410 treesize of output 420 [2023-08-30 21:30:24,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:24,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 426 [2023-08-30 21:30:24,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:24,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 315 [2023-08-30 21:30:28,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:30:28,427 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 135 treesize of output 99 [2023-08-30 21:30:28,446 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:30:28,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 554 treesize of output 528 [2023-08-30 21:30:28,479 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:30:28,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 520 treesize of output 424 [2023-08-30 21:30:28,516 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:30:28,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 416 treesize of output 372 [2023-08-30 21:30:28,557 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:30:28,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 287 [2023-08-30 21:30:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:30:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429838843] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:30:29,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:30:29,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2023-08-30 21:30:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886655783] [2023-08-30 21:30:29,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:30:29,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-30 21:30:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:30:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-30 21:30:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1229, Unknown=7, NotChecked=74, Total=1560 [2023-08-30 21:30:29,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-08-30 21:30:29,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1034 transitions, 16521 flow. Second operand has 40 states, 40 states have (on average 65.75) internal successors, (2630), 40 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states 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 21:30:29,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:30:29,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-08-30 21:30:29,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:30:53,768 INFO L130 PetriNetUnfolder]: 17366/29162 cut-off events. [2023-08-30 21:30:53,769 INFO L131 PetriNetUnfolder]: For 842542/842542 co-relation queries the response was YES. [2023-08-30 21:30:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258500 conditions, 29162 events. 17366/29162 cut-off events. For 842542/842542 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 223812 event pairs, 1462 based on Foata normal form. 664/29826 useless extension candidates. Maximal degree in co-relation 258392. Up to 8442 conditions per place. [2023-08-30 21:30:54,182 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 1236 selfloop transitions, 1274 changer transitions 1170/3680 dead transitions. [2023-08-30 21:30:54,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3680 transitions, 65247 flow [2023-08-30 21:30:54,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-08-30 21:30:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2023-08-30 21:30:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 8008 transitions. [2023-08-30 21:30:54,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28555127656539725 [2023-08-30 21:30:54,192 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 8008 transitions. [2023-08-30 21:30:54,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 8008 transitions. [2023-08-30 21:30:54,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:30:54,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 8008 transitions. [2023-08-30 21:30:54,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 115 states, 114 states have (on average 70.24561403508773) internal successors, (8008), 114 states have internal predecessors, (8008), 0 states have call successors, (0), 0 states 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 21:30:54,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 115 states, 115 states have (on average 246.0) internal successors, (28290), 115 states have internal predecessors, (28290), 0 states have call successors, (0), 0 states 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 21:30:54,229 INFO L81 ComplementDD]: Finished complementDD. Result has 115 states, 115 states have (on average 246.0) internal successors, (28290), 115 states have internal predecessors, (28290), 0 states have call successors, (0), 0 states 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 21:30:54,230 INFO L175 Difference]: Start difference. First operand has 396 places, 1034 transitions, 16521 flow. Second operand 114 states and 8008 transitions. [2023-08-30 21:30:54,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 3680 transitions, 65247 flow [2023-08-30 21:31:03,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 3680 transitions, 52417 flow, removed 5830 selfloop flow, removed 35 redundant places. [2023-08-30 21:31:03,714 INFO L231 Difference]: Finished difference. Result has 518 places, 1809 transitions, 27234 flow [2023-08-30 21:31:03,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=13125, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=27234, PETRI_PLACES=518, PETRI_TRANSITIONS=1809} [2023-08-30 21:31:03,715 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 487 predicate places. [2023-08-30 21:31:03,715 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 1809 transitions, 27234 flow [2023-08-30 21:31:03,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 65.75) internal successors, (2630), 40 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states 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 21:31:03,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:31:03,716 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:31:03,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 21:31:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 21:31:03,916 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 21:31:03,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:31:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1759649258, now seen corresponding path program 11 times [2023-08-30 21:31:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:31:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910170958] [2023-08-30 21:31:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:31:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:31:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:31:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:31:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:31:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910170958] [2023-08-30 21:31:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910170958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:31:04,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72304532] [2023-08-30 21:31:04,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 21:31:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:31:04,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:31:04,871 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:31:04,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 21:31:04,990 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-08-30 21:31:04,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:31:04,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-30 21:31:04,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:31:05,107 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 21:31:05,157 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 21:31:05,229 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 21:31:05,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:31:05,379 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 18 treesize of output 20 [2023-08-30 21:31:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:31:05,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:31:05,952 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse8)) (.cse2 (+ c_~queue~0.offset .cse8 4))) (and (or (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (select .cse4 .cse3) 1)) (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1))))) .cse5) (or (not .cse5) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2))) (not (= (+ (select .cse6 .cse3) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))))))) (< c_~back~0 0)) is different from false [2023-08-30 21:31:06,344 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (<= c_~n~0 (+ c_~back~0 1))) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10))) (.cse2 (+ c_~queue~0.offset .cse11)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse4 (+ c_~queue~0.offset .cse10 4))) (and (or .cse0 (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 (not (= .cse7 1))) (or (not .cse0) .cse6 (not (= (+ .cse7 1) 0)) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1) (not (= (select .cse8 .cse4) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3))) (not (= (select .cse9 .cse4) 1)))))))))) (< c_~back~0 0)) is different from false [2023-08-30 21:31:06,381 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6)) (.cse2 (+ c_~queue~0.offset .cse6 4)) (.cse3 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1) (not (= (+ (select .cse4 .cse3) 1) 0)))))))) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) 1)))) is different from false [2023-08-30 21:31:06,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:06,822 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 132 treesize of output 96 [2023-08-30 21:31:06,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:06,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3510 treesize of output 3322 [2023-08-30 21:31:06,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:06,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 330 treesize of output 340 [2023-08-30 21:31:06,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:06,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 356 treesize of output 294 [2023-08-30 21:31:06,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:06,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 259 [2023-08-30 21:31:09,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 21:31:09,902 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 132 treesize of output 96 [2023-08-30 21:31:09,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 21:31:09,931 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:31:09,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 240 [2023-08-30 21:31:09,961 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:31:09,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-08-30 21:31:09,991 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-30 21:31:09,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-08-30 21:31:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 21:31:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72304532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 21:31:10,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 21:31:10,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2023-08-30 21:31:10,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159214354] [2023-08-30 21:31:10,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 21:31:10,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-30 21:31:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 21:31:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-30 21:31:10,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=947, Unknown=8, NotChecked=198, Total=1332 [2023-08-30 21:31:10,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-08-30 21:31:10,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1809 transitions, 27234 flow. Second operand has 37 states, 37 states have (on average 63.891891891891895) internal successors, (2364), 37 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states 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 21:31:10,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 21:31:10,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-08-30 21:31:10,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 21:31:11,191 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse5 (+ c_~queue~0.offset .cse9 4)) (.cse1 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse2 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse2 .cse3) 1) 0)) (<= 0 (+ (select .cse2 .cse4) c_~sum~0 (select .cse2 .cse5))))))))) (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse3) 1) 0)) (<= (+ (select .cse6 .cse4) c_~sum~0 (select .cse6 .cse5)) 1)))) (not (= (select (select .cse7 c_~queue~0.base) .cse1) 1)))))))) (< c_~back~0 0)) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-08-30 21:31:11,205 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse8 (<= c_~n~0 (+ c_~back~0 1))) (.cse9 (< c_~back~0 0)) (.cse10 (<= 0 c_~sum~0))) (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse6 (* c_~back~0 4))) (or .cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse7)) (.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1) (not (= (+ (select .cse5 .cse4) 1) 0)))))))) .cse8 .cse9 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) 1)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse10 (<= c_~sum~0 1)) .cse0 .cse8 .cse9 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 c_~v_assert~0) .cse10)) is different from false [2023-08-30 21:31:12,028 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (< c_~back~0 0)) (.cse13 (<= 0 c_~sum~0))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10))) (.cse2 (+ c_~queue~0.offset .cse11)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse4 (+ c_~queue~0.offset .cse10 4))) (and (or .cse0 (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 (not (= .cse7 1))) (or (not .cse0) .cse6 (not (= (+ .cse7 1) 0)) (and (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1) (not (= (select .cse8 .cse4) 1))))) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3))) (not (= (select .cse9 .cse4) 1)))))))))) .cse12) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse13 (<= c_~sum~0 1)) (= (mod c_~v_assert~0 256) 0) .cse6 .cse12 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) .cse13)) is different from false [2023-08-30 21:31:15,206 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (< c_~back~0 0))) (and (or .cse0 .cse1 (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse10 4)) (.cse6 (+ c_~queue~0.offset .cse11)) (.cse7 (+ c_~queue~0.offset .cse11 4)) (.cse3 (+ c_~queue~0.offset .cse10))) (and (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (not (= (select (select .cse2 c_~queue~0.base) .cse3) 1)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse4 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse4 .cse5) 1) 0)) (<= 0 (+ (select .cse4 .cse6) c_~sum~0 (select .cse4 .cse7))))))))) (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_625))) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse5) 1) 0)) (<= (+ (select .cse8 .cse6) c_~sum~0 (select .cse8 .cse7)) 1)))) (not (= (select (select .cse9 c_~queue~0.base) .cse3) 1)))))))) .cse12) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse0 .cse1 .cse12 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0))) is different from false [2023-08-30 21:31:32,120 INFO L130 PetriNetUnfolder]: 24031/40160 cut-off events. [2023-08-30 21:31:32,120 INFO L131 PetriNetUnfolder]: For 652364/652364 co-relation queries the response was YES. [2023-08-30 21:31:32,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310603 conditions, 40160 events. 24031/40160 cut-off events. For 652364/652364 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 317411 event pairs, 2565 based on Foata normal form. 1168/41328 useless extension candidates. Maximal degree in co-relation 310472. Up to 12682 conditions per place. [2023-08-30 21:31:33,122 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 1463 selfloop transitions, 1622 changer transitions 1296/4381 dead transitions. [2023-08-30 21:31:33,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 4381 transitions, 73433 flow [2023-08-30 21:31:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-08-30 21:31:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-08-30 21:31:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 5702 transitions. [2023-08-30 21:31:33,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.279263395043589 [2023-08-30 21:31:33,131 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 5702 transitions. [2023-08-30 21:31:33,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 5702 transitions. [2023-08-30 21:31:33,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 21:31:33,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 5702 transitions. [2023-08-30 21:31:33,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 68.6987951807229) internal successors, (5702), 83 states have internal predecessors, (5702), 0 states have call successors, (0), 0 states 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 21:31:33,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 246.0) internal successors, (20664), 84 states have internal predecessors, (20664), 0 states have call successors, (0), 0 states 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 21:31:33,164 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 246.0) internal successors, (20664), 84 states have internal predecessors, (20664), 0 states have call successors, (0), 0 states 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 21:31:33,164 INFO L175 Difference]: Start difference. First operand has 518 places, 1809 transitions, 27234 flow. Second operand 83 states and 5702 transitions. [2023-08-30 21:31:33,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 4381 transitions, 73433 flow [2023-08-30 21:31:41,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 4381 transitions, 70815 flow, removed 1225 selfloop flow, removed 22 redundant places. [2023-08-30 21:31:41,635 INFO L231 Difference]: Finished difference. Result has 608 places, 2329 transitions, 41131 flow [2023-08-30 21:31:41,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=21584, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=843, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=41131, PETRI_PLACES=608, PETRI_TRANSITIONS=2329} [2023-08-30 21:31:41,637 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 577 predicate places. [2023-08-30 21:31:41,637 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 2329 transitions, 41131 flow [2023-08-30 21:31:41,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 63.891891891891895) internal successors, (2364), 37 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states 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 21:31:41,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 21:31:41,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 21:31:41,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 21:31:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-30 21:31:41,838 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 21:31:41,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 21:31:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -276382848, now seen corresponding path program 12 times [2023-08-30 21:31:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 21:31:41,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893173609] [2023-08-30 21:31:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 21:31:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 21:31:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 21:31:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:31:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 21:31:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893173609] [2023-08-30 21:31:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893173609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 21:31:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853978301] [2023-08-30 21:31:42,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 21:31:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 21:31:42,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 21:31:42,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 21:31:42,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 21:31:43,059 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-30 21:31:43,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 21:31:43,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-30 21:31:43,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 21:31:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 21:31:43,379 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 18 treesize of output 20 [2023-08-30 21:31:43,738 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-08-30 21:31:43,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 17 [2023-08-30 21:31:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 21:31:43,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 21:31:45,510 INFO L321 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2023-08-30 21:31:45,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 553 treesize of output 577 [2023-08-30 21:31:45,582 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 21:31:45,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 319 [2023-08-30 21:31:45,649 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 21:31:45,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 301 [2023-08-30 21:31:45,724 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 21:31:45,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 283 [2023-08-30 21:31:45,780 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-30 21:31:45,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 265 Killed by 15