./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 BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/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 BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 14:33:46,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 14:33:46,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 14:33:46,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 14:33:46,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 14:33:46,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 14:33:46,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 14:33:46,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 14:33:46,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 14:33:46,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 14:33:46,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 14:33:46,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 14:33:46,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 14:33:46,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 14:33:46,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 14:33:46,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 14:33:46,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 14:33:46,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 14:33:46,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 14:33:46,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 14:33:46,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 14:33:46,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 14:33:46,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 14:33:46,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 14:33:46,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 14:33:46,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 14:33:46,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 14:33:46,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 14:33:46,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 14:33:46,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 14:33:46,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 14:33:46,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 14:33:46,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 14:33:46,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 14:33:46,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 14:33:46,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 14:33:46,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 14:33:46,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 14:33:46,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 14:33:46,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 14:33:46,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 14:33:46,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 14:33:46,691 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 14:33:46,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 14:33:46,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 14:33:46,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 14:33:46,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 14:33:46,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 14:33:46,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 14:33:46,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 14:33:46,693 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 14:33:46,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 14:33:46,694 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 14:33:46,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 14:33:46,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 14:33:46,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 14:33:46,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 14:33:46,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 14:33:46,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 14:33:46,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 14:33:46,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:33:46,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 14:33:46,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 14:33:46,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 14:33:46,697 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 14:33:46,698 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 -> BEFORE [2023-09-01 14:33:46,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 14:33:46,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 14:33:46,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 14:33:46,933 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 14:33:46,933 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 14:33:46,935 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-09-01 14:33:47,807 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 14:33:47,964 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 14:33:47,965 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-09-01 14:33:47,969 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8bc84cc/6ed624a9ef864ff48854bbeb9968ec52/FLAGb8cb8a10c [2023-09-01 14:33:47,979 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8bc84cc/6ed624a9ef864ff48854bbeb9968ec52 [2023-09-01 14:33:47,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 14:33:47,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 14:33:47,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 14:33:47,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 14:33:47,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 14:33:47,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:33:47" (1/1) ... [2023-09-01 14:33:47,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779f622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:47, skipping insertion in model container [2023-09-01 14:33:47,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:33:47" (1/1) ... [2023-09-01 14:33:47,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 14:33:48,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 14:33:48,115 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-09-01 14:33:48,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:33:48,126 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 14:33:48,150 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-09-01 14:33:48,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:33:48,162 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:33:48,162 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:33:48,174 INFO L208 MainTranslator]: Completed translation [2023-09-01 14:33:48,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48 WrapperNode [2023-09-01 14:33:48,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 14:33:48,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 14:33:48,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 14:33:48,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 14:33:48,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,258 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-09-01 14:33:48,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 14:33:48,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 14:33:48,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 14:33:48,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 14:33:48,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 14:33:48,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 14:33:48,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 14:33:48,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 14:33:48,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (1/1) ... [2023-09-01 14:33:48,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:33:48,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:33:48,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 14:33:48,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 14:33:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 14:33:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 14:33:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 14:33:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 14:33:48,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 14:33:48,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 14:33:48,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 14:33:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 14:33:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 14:33:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 14:33:48,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 14:33:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 14:33:48,362 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 14:33:48,474 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 14:33:48,475 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 14:33:48,705 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 14:33:48,780 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 14:33:48,780 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 14:33:48,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:33:48 BoogieIcfgContainer [2023-09-01 14:33:48,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 14:33:48,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 14:33:48,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 14:33:48,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 14:33:48,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:33:47" (1/3) ... [2023-09-01 14:33:48,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a114c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:33:48, skipping insertion in model container [2023-09-01 14:33:48,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:33:48" (2/3) ... [2023-09-01 14:33:48,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a114c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:33:48, skipping insertion in model container [2023-09-01 14:33:48,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:33:48" (3/3) ... [2023-09-01 14:33:48,788 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-09-01 14:33:48,793 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 14:33:48,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 14:33:48,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 14:33:48,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 14:33:48,864 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 14:33:48,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-09-01 14:33:48,945 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-09-01 14:33:48,946 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:33:48,950 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-09-01 14:33:48,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-09-01 14:33:48,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-09-01 14:33:48,962 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 14:33:48,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-09-01 14:33:48,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-09-01 14:33:48,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-09-01 14:33:48,988 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-09-01 14:33:48,988 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:33:48,992 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-09-01 14:33:48,993 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-09-01 14:33:52,530 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-09-01 14:33:52,530 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-09-01 14:33:52,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 14:33:52,546 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;@723fafe2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 14:33:52,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 14:33:52,552 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-09-01 14:33:52,552 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 14:33:52,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:52,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:33:52,553 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-09-01 14:33:52,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-09-01 14:33:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978816663] [2023-09-01 14:33:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978816663] [2023-09-01 14:33:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978816663] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:33:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:33:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:33:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719176795] [2023-09-01 14:33:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:33:52,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:33:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:33:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:33:52,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-09-01 14:33:52,854 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-09-01 14:33:52,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:52,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-09-01 14:33:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:33:52,978 INFO L130 PetriNetUnfolder]: 142/245 cut-off events. [2023-09-01 14:33:52,979 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-09-01 14:33:52,987 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-09-01 14:33:52,990 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 40 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-09-01 14:33:52,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 214 flow [2023-09-01 14:33:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 14:33:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 14:33:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-09-01 14:33:53,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2023-09-01 14:33:53,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-09-01 14:33:53,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-09-01 14:33:53,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:33:53,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-09-01 14:33:53,009 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-09-01 14:33:53,013 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-09-01 14:33:53,013 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-09-01 14:33:53,015 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 612 transitions. [2023-09-01 14:33:53,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 214 flow [2023-09-01 14:33:53,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 191 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-09-01 14:33:53,018 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-09-01 14:33:53,019 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-09-01 14:33:53,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-09-01 14:33:53,021 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-09-01 14:33:53,022 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-09-01 14:33:53,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:53,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:33:53,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 14:33:53,022 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-09-01 14:33:53,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash 919484616, now seen corresponding path program 2 times [2023-09-01 14:33:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:53,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975998351] [2023-09-01 14:33:53,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:53,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:53,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975998351] [2023-09-01 14:33:53,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975998351] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:33:53,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:33:53,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:33:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921582675] [2023-09-01 14:33:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:33:53,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:33:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:33:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:33:53,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-09-01 14:33:53,170 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-09-01 14:33:53,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:53,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-09-01 14:33:53,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:33:53,259 INFO L130 PetriNetUnfolder]: 186/318 cut-off events. [2023-09-01 14:33:53,259 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-09-01 14:33:53,260 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-09-01 14:33:53,261 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-09-01 14:33:53,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 229 flow [2023-09-01 14:33:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 14:33:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 14:33:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-09-01 14:33:53,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2023-09-01 14:33:53,264 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-09-01 14:33:53,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-09-01 14:33:53,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:33:53,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-09-01 14:33:53,266 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-09-01 14:33:53,268 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-09-01 14:33:53,269 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-09-01 14:33:53,269 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 610 transitions. [2023-09-01 14:33:53,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 229 flow [2023-09-01 14:33:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:33:53,271 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-09-01 14:33:53,271 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-09-01 14:33:53,272 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-09-01 14:33:53,272 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-09-01 14:33:53,272 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-09-01 14:33:53,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:53,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:33:53,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 14:33:53,273 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-09-01 14:33:53,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-09-01 14:33:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7813069] [2023-09-01 14:33:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7813069] [2023-09-01 14:33:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7813069] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:33:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:33:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 14:33:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509476645] [2023-09-01 14:33:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:33:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 14:33:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 14:33:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 14:33:53,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-09-01 14:33:53,422 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-09-01 14:33:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:53,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-09-01 14:33:53,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:33:53,541 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2023-09-01 14:33:53,542 INFO L131 PetriNetUnfolder]: For 336/349 co-relation queries the response was YES. [2023-09-01 14:33:53,542 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-09-01 14:33:53,543 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 44 selfloop transitions, 8 changer transitions 21/76 dead transitions. [2023-09-01 14:33:53,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 414 flow [2023-09-01 14:33:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 14:33:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 14:33:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-09-01 14:33:53,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2023-09-01 14:33:53,546 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-09-01 14:33:53,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-09-01 14:33:53,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:33:53,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-09-01 14:33:53,548 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-09-01 14:33:53,550 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-09-01 14:33:53,551 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-09-01 14:33:53,551 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 852 transitions. [2023-09-01 14:33:53,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 414 flow [2023-09-01 14:33:53,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:33:53,553 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-09-01 14:33:53,553 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-09-01 14:33:53,554 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-09-01 14:33:53,554 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-09-01 14:33:53,555 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-09-01 14:33:53,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:53,555 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-09-01 14:33:53,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 14:33:53,555 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-09-01 14:33:53,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1817089691, now seen corresponding path program 1 times [2023-09-01 14:33:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610388023] [2023-09-01 14:33:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:53,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610388023] [2023-09-01 14:33:53,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610388023] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:33:53,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:33:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 14:33:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674029095] [2023-09-01 14:33:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:33:53,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 14:33:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 14:33:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 14:33:53,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-09-01 14:33:53,634 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-09-01 14:33:53,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:53,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-09-01 14:33:53,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:33:53,678 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-09-01 14:33:53,678 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-09-01 14:33:53,679 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-09-01 14:33:53,679 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-09-01 14:33:53,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-09-01 14:33:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 14:33:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 14:33:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-09-01 14:33:53,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494579945799458 [2023-09-01 14:33:53,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-09-01 14:33:53,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-09-01 14:33:53,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:33:53,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-09-01 14:33:53,682 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-09-01 14:33:53,683 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-09-01 14:33:53,684 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-09-01 14:33:53,684 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 365 transitions. [2023-09-01 14:33:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-09-01 14:33:53,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-09-01 14:33:53,686 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-09-01 14:33:53,686 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-09-01 14:33:53,686 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-09-01 14:33:53,686 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-09-01 14:33:53,687 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-09-01 14:33:53,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:53,687 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-09-01 14:33:53,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 14:33:53,687 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-09-01 14:33:53,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-09-01 14:33:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960336631] [2023-09-01 14:33:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:33:53,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:53,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960336631] [2023-09-01 14:33:53,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960336631] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:33:53,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:33:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:33:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518746211] [2023-09-01 14:33:53,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:33:53,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:33:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:33:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:33:53,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-09-01 14:33:53,778 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-09-01 14:33:53,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:53,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-09-01 14:33:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:33:53,830 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-09-01 14:33:53,831 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-09-01 14:33:53,831 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-09-01 14:33:53,832 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-09-01 14:33:53,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-09-01 14:33:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:33:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:33:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-09-01 14:33:53,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49085365853658536 [2023-09-01 14:33:53,833 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-09-01 14:33:53,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-09-01 14:33:53,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:33:53,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-09-01 14:33:53,835 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-09-01 14:33:53,836 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-09-01 14:33:53,836 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-09-01 14:33:53,836 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 483 transitions. [2023-09-01 14:33:53,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-09-01 14:33:53,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:33:53,838 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-09-01 14:33:53,838 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-09-01 14:33:53,838 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-09-01 14:33:53,839 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-09-01 14:33:53,839 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-09-01 14:33:53,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:33:53,839 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-09-01 14:33:53,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 14:33:53,839 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-09-01 14:33:53,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:33:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-09-01 14:33:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:33:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595327496] [2023-09-01 14:33:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:33:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:33:54,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595327496] [2023-09-01 14:33:54,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595327496] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:33:54,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679674852] [2023-09-01 14:33:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:33:54,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:33:54,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:33:54,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:33:54,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 14:33:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:33:54,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-09-01 14:33:54,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:33:54,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 14:33:54,675 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-09-01 14:33:54,722 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-09-01 14:33:54,765 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-09-01 14:33:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:33:54,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:33:55,368 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-09-01 14:33:55,438 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-09-01 14:33:55,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:55,472 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-09-01 14:33:55,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:55,486 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-09-01 14:33:55,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:55,519 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-09-01 14:33:55,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:55,536 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-09-01 14:33:55,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:55,555 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-09-01 14:33:56,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:33:56,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-09-01 14:33:56,057 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:33:56,058 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-09-01 14:33:56,082 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:33:56,082 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-09-01 14:33:56,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:33:56,095 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-09-01 14:33:56,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:33:56,106 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-09-01 14:33:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 14:33:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679674852] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:33:56,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:33:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-09-01 14:33:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561536721] [2023-09-01 14:33:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:33:56,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 14:33:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:33:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 14:33:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=616, Unknown=5, NotChecked=106, Total=870 [2023-09-01 14:33:56,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-09-01 14:33:56,371 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-09-01 14:33:56,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:33:56,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-09-01 14:33:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:02,277 INFO L130 PetriNetUnfolder]: 1286/2153 cut-off events. [2023-09-01 14:34:02,277 INFO L131 PetriNetUnfolder]: For 2109/2109 co-relation queries the response was YES. [2023-09-01 14:34:02,280 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-09-01 14:34:02,285 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 294 selfloop transitions, 173 changer transitions 25/492 dead transitions. [2023-09-01 14:34:02,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 492 transitions, 2839 flow [2023-09-01 14:34:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-09-01 14:34:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-09-01 14:34:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 6068 transitions. [2023-09-01 14:34:02,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2023-09-01 14:34:02,301 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 6068 transitions. [2023-09-01 14:34:02,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 6068 transitions. [2023-09-01 14:34:02,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:02,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 6068 transitions. [2023-09-01 14:34:02,315 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-09-01 14:34:02,336 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-09-01 14:34:02,339 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-09-01 14:34:02,339 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 90 states and 6068 transitions. [2023-09-01 14:34:02,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 492 transitions, 2839 flow [2023-09-01 14:34:02,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 492 transitions, 2801 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-09-01 14:34:02,348 INFO L231 Difference]: Finished difference. Result has 162 places, 215 transitions, 1574 flow [2023-09-01 14:34:02,348 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-09-01 14:34:02,350 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2023-09-01 14:34:02,350 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 215 transitions, 1574 flow [2023-09-01 14:34:02,351 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-09-01 14:34:02,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:02,351 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-09-01 14:34:02,359 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-09-01 14:34:02,557 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-09-01 14:34:02,557 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-09-01 14:34:02,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-09-01 14:34:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809926959] [2023-09-01 14:34:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809926959] [2023-09-01 14:34:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809926959] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001289874] [2023-09-01 14:34:03,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 14:34:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:03,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:03,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 14:34:03,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 14:34:03,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:03,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-09-01 14:34:03,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:03,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 14:34:03,216 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-09-01 14:34:03,266 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-09-01 14:34:03,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:34:03,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 14:34:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:03,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:03,591 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-09-01 14:34:03,625 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-09-01 14:34:03,641 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-09-01 14:34:03,657 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-09-01 14:34:03,703 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-09-01 14:34:03,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:03,833 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-09-01 14:34:03,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:03,842 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-09-01 14:34:03,852 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-09-01 14:34:03,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:03,867 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-09-01 14:34:03,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:03,877 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-09-01 14:34:04,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:04,095 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-09-01 14:34:04,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:34:04,102 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:34:04,103 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-09-01 14:34:04,111 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:34:04,111 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-09-01 14:34:04,126 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:34:04,126 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-09-01 14:34:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 14:34:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001289874] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:04,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-09-01 14:34:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223849396] [2023-09-01 14:34:04,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 14:34:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:04,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 14:34:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2023-09-01 14:34:04,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-09-01 14:34:04,303 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-09-01 14:34:04,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:04,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-09-01 14:34:04,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:05,115 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-09-01 14:34:05,471 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-09-01 14:34:06,945 INFO L130 PetriNetUnfolder]: 1467/2438 cut-off events. [2023-09-01 14:34:06,946 INFO L131 PetriNetUnfolder]: For 71043/71043 co-relation queries the response was YES. [2023-09-01 14:34:06,951 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-09-01 14:34:06,961 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 234 selfloop transitions, 168 changer transitions 111/513 dead transitions. [2023-09-01 14:34:06,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 513 transitions, 5566 flow [2023-09-01 14:34:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-09-01 14:34:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-09-01 14:34:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3986 transitions. [2023-09-01 14:34:06,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2746313903817004 [2023-09-01 14:34:06,968 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3986 transitions. [2023-09-01 14:34:06,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3986 transitions. [2023-09-01 14:34:06,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:06,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3986 transitions. [2023-09-01 14:34:06,976 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-09-01 14:34:06,986 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-09-01 14:34:06,988 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-09-01 14:34:06,988 INFO L175 Difference]: Start difference. First operand has 162 places, 215 transitions, 1574 flow. Second operand 59 states and 3986 transitions. [2023-09-01 14:34:06,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 513 transitions, 5566 flow [2023-09-01 14:34:07,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 513 transitions, 4843 flow, removed 251 selfloop flow, removed 13 redundant places. [2023-09-01 14:34:07,136 INFO L231 Difference]: Finished difference. Result has 234 places, 256 transitions, 2455 flow [2023-09-01 14:34:07,136 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-09-01 14:34:07,137 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2023-09-01 14:34:07,137 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 256 transitions, 2455 flow [2023-09-01 14:34:07,138 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-09-01 14:34:07,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:07,138 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-09-01 14:34:07,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 14:34:07,345 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-09-01 14:34:07,345 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-09-01 14:34:07,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1053388881, now seen corresponding path program 3 times [2023-09-01 14:34:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745813904] [2023-09-01 14:34:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:07,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745813904] [2023-09-01 14:34:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745813904] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823874933] [2023-09-01 14:34:07,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 14:34:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:07,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:07,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 14:34:08,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 14:34:08,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:08,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-09-01 14:34:08,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:34:08,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:08,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:08,294 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-09-01 14:34:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 14:34:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823874933] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:08,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2023-09-01 14:34:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119031448] [2023-09-01 14:34:08,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:08,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-09-01 14:34:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-09-01 14:34:08,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-09-01 14:34:08,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 246 [2023-09-01 14:34:08,975 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-09-01 14:34:08,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:08,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 246 [2023-09-01 14:34:08,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:10,504 INFO L130 PetriNetUnfolder]: 1574/2651 cut-off events. [2023-09-01 14:34:10,505 INFO L131 PetriNetUnfolder]: For 147856/147856 co-relation queries the response was YES. [2023-09-01 14:34:10,513 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-09-01 14:34:10,526 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 236 selfloop transitions, 153 changer transitions 60/449 dead transitions. [2023-09-01 14:34:10,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 449 transitions, 5322 flow [2023-09-01 14:34:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-09-01 14:34:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-09-01 14:34:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3212 transitions. [2023-09-01 14:34:10,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373054587688734 [2023-09-01 14:34:10,531 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3212 transitions. [2023-09-01 14:34:10,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3212 transitions. [2023-09-01 14:34:10,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:10,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3212 transitions. [2023-09-01 14:34:10,535 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-09-01 14:34:10,540 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-09-01 14:34:10,541 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-09-01 14:34:10,541 INFO L175 Difference]: Start difference. First operand has 234 places, 256 transitions, 2455 flow. Second operand 35 states and 3212 transitions. [2023-09-01 14:34:10,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 449 transitions, 5322 flow [2023-09-01 14:34:10,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 449 transitions, 4630 flow, removed 303 selfloop flow, removed 29 redundant places. [2023-09-01 14:34:11,002 INFO L231 Difference]: Finished difference. Result has 235 places, 287 transitions, 2888 flow [2023-09-01 14:34:11,002 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-09-01 14:34:11,003 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2023-09-01 14:34:11,003 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 287 transitions, 2888 flow [2023-09-01 14:34:11,004 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-09-01 14:34:11,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:11,004 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-09-01 14:34:11,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-01 14:34:11,205 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-09-01 14:34:11,206 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-09-01 14:34:11,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash 238639103, now seen corresponding path program 4 times [2023-09-01 14:34:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940083465] [2023-09-01 14:34:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940083465] [2023-09-01 14:34:11,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940083465] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607674641] [2023-09-01 14:34:11,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 14:34:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:11,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 14:34:11,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 14:34:11,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:11,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-09-01 14:34:11,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:12,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:34:12,061 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-09-01 14:34:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:34:12,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:12,246 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-09-01 14:34:12,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:12,268 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-09-01 14:34:12,272 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-09-01 14:34:12,275 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-09-01 14:34:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 14:34:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607674641] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:12,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-09-01 14:34:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117949803] [2023-09-01 14:34:12,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-01 14:34:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-01 14:34:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2023-09-01 14:34:12,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-09-01 14:34:12,524 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-09-01 14:34:12,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:12,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-09-01 14:34:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:16,511 INFO L130 PetriNetUnfolder]: 1666/2784 cut-off events. [2023-09-01 14:34:16,511 INFO L131 PetriNetUnfolder]: For 155899/155899 co-relation queries the response was YES. [2023-09-01 14:34:16,520 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-09-01 14:34:16,533 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 223 selfloop transitions, 202 changer transitions 37/462 dead transitions. [2023-09-01 14:34:16,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 462 transitions, 5830 flow [2023-09-01 14:34:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-01 14:34:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-09-01 14:34:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2798 transitions. [2023-09-01 14:34:16,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29931536157466837 [2023-09-01 14:34:16,574 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2798 transitions. [2023-09-01 14:34:16,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2798 transitions. [2023-09-01 14:34:16,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:16,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2798 transitions. [2023-09-01 14:34:16,577 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-09-01 14:34:16,583 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-09-01 14:34:16,584 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-09-01 14:34:16,584 INFO L175 Difference]: Start difference. First operand has 235 places, 287 transitions, 2888 flow. Second operand 38 states and 2798 transitions. [2023-09-01 14:34:16,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 462 transitions, 5830 flow [2023-09-01 14:34:16,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 462 transitions, 5107 flow, removed 264 selfloop flow, removed 17 redundant places. [2023-09-01 14:34:16,969 INFO L231 Difference]: Finished difference. Result has 257 places, 316 transitions, 3239 flow [2023-09-01 14:34:16,969 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-09-01 14:34:16,969 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 226 predicate places. [2023-09-01 14:34:16,970 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 316 transitions, 3239 flow [2023-09-01 14:34:16,970 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-09-01 14:34:16,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:16,970 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-09-01 14:34:16,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 14:34:17,172 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-09-01 14:34:17,172 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-09-01 14:34:17,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2047561495, now seen corresponding path program 5 times [2023-09-01 14:34:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434693542] [2023-09-01 14:34:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434693542] [2023-09-01 14:34:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434693542] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645155614] [2023-09-01 14:34:17,294 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 14:34:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:17,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:17,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:17,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 14:34:17,368 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-09-01 14:34:17,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:17,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-01 14:34:17,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:17,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:17,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645155614] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:17,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:17,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-09-01 14:34:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344270099] [2023-09-01 14:34:17,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:17,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 14:34:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 14:34:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-09-01 14:34:17,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-09-01 14:34:17,660 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-09-01 14:34:17,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:17,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-09-01 14:34:17,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:18,028 INFO L130 PetriNetUnfolder]: 778/1476 cut-off events. [2023-09-01 14:34:18,028 INFO L131 PetriNetUnfolder]: For 104590/104647 co-relation queries the response was YES. [2023-09-01 14:34:18,034 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-09-01 14:34:18,040 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 127 selfloop transitions, 25 changer transitions 45/257 dead transitions. [2023-09-01 14:34:18,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 257 transitions, 2979 flow [2023-09-01 14:34:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 14:34:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 14:34:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2023-09-01 14:34:18,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-09-01 14:34:18,042 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 902 transitions. [2023-09-01 14:34:18,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 902 transitions. [2023-09-01 14:34:18,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:18,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 902 transitions. [2023-09-01 14:34:18,043 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-09-01 14:34:18,044 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-09-01 14:34:18,044 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-09-01 14:34:18,044 INFO L175 Difference]: Start difference. First operand has 257 places, 316 transitions, 3239 flow. Second operand 8 states and 902 transitions. [2023-09-01 14:34:18,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 257 transitions, 2979 flow [2023-09-01 14:34:18,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 257 transitions, 2643 flow, removed 68 selfloop flow, removed 41 redundant places. [2023-09-01 14:34:18,235 INFO L231 Difference]: Finished difference. Result has 202 places, 209 transitions, 1911 flow [2023-09-01 14:34:18,235 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-09-01 14:34:18,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2023-09-01 14:34:18,236 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 209 transitions, 1911 flow [2023-09-01 14:34:18,236 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-09-01 14:34:18,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:18,236 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-09-01 14:34:18,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 14:34:18,436 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-09-01 14:34:18,437 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-09-01 14:34:18,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1748716820, now seen corresponding path program 6 times [2023-09-01 14:34:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:18,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916268988] [2023-09-01 14:34:18,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:19,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:19,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916268988] [2023-09-01 14:34:19,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916268988] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:19,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159706571] [2023-09-01 14:34:19,523 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 14:34:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:19,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:19,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 14:34:19,610 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-09-01 14:34:19,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:19,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjunts are in the unsatisfiable core [2023-09-01 14:34:19,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:34:19,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:19,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:19,914 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-09-01 14:34:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:34:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159706571] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:20,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 25 [2023-09-01 14:34:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403289101] [2023-09-01 14:34:20,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:20,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-09-01 14:34:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-09-01 14:34:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-09-01 14:34:21,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 246 [2023-09-01 14:34:21,086 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-09-01 14:34:21,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:21,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 246 [2023-09-01 14:34:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:22,698 INFO L130 PetriNetUnfolder]: 1111/1858 cut-off events. [2023-09-01 14:34:22,698 INFO L131 PetriNetUnfolder]: For 39985/39985 co-relation queries the response was YES. [2023-09-01 14:34:22,703 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-09-01 14:34:22,708 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 166 selfloop transitions, 148 changer transitions 37/351 dead transitions. [2023-09-01 14:34:22,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 351 transitions, 4056 flow [2023-09-01 14:34:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-09-01 14:34:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-09-01 14:34:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2821 transitions. [2023-09-01 14:34:22,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34749938408474995 [2023-09-01 14:34:22,711 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2821 transitions. [2023-09-01 14:34:22,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2821 transitions. [2023-09-01 14:34:22,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:22,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2821 transitions. [2023-09-01 14:34:22,714 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-09-01 14:34:22,718 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-09-01 14:34:22,718 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-09-01 14:34:22,719 INFO L175 Difference]: Start difference. First operand has 202 places, 209 transitions, 1911 flow. Second operand 33 states and 2821 transitions. [2023-09-01 14:34:22,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 351 transitions, 4056 flow [2023-09-01 14:34:22,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 351 transitions, 3820 flow, removed 92 selfloop flow, removed 12 redundant places. [2023-09-01 14:34:22,767 INFO L231 Difference]: Finished difference. Result has 203 places, 225 transitions, 2418 flow [2023-09-01 14:34:22,767 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-09-01 14:34:22,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2023-09-01 14:34:22,768 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 225 transitions, 2418 flow [2023-09-01 14:34:22,768 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-09-01 14:34:22,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:22,769 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-09-01 14:34:22,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 14:34:22,973 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-09-01 14:34:22,974 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-09-01 14:34:22,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -274856926, now seen corresponding path program 7 times [2023-09-01 14:34:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702481672] [2023-09-01 14:34:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702481672] [2023-09-01 14:34:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702481672] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379844057] [2023-09-01 14:34:23,714 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 14:34:23,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:23,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:23,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:23,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 14:34:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2023-09-01 14:34:23,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:34:23,969 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-09-01 14:34:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:34:24,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:24,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:24,210 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-09-01 14:34:24,215 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-09-01 14:34:24,218 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-09-01 14:34:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:34:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379844057] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:24,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2023-09-01 14:34:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568140245] [2023-09-01 14:34:24,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:24,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 14:34:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 14:34:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=743, Unknown=9, NotChecked=0, Total=870 [2023-09-01 14:34:24,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-09-01 14:34:24,704 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-09-01 14:34:24,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:24,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-09-01 14:34:24,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:26,174 INFO L130 PetriNetUnfolder]: 1161/1938 cut-off events. [2023-09-01 14:34:26,174 INFO L131 PetriNetUnfolder]: For 22842/22842 co-relation queries the response was YES. [2023-09-01 14:34:26,180 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-09-01 14:34:26,186 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 170 selfloop transitions, 143 changer transitions 37/350 dead transitions. [2023-09-01 14:34:26,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 350 transitions, 4297 flow [2023-09-01 14:34:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-01 14:34:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-09-01 14:34:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2212 transitions. [2023-09-01 14:34:26,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2997289972899729 [2023-09-01 14:34:26,191 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2212 transitions. [2023-09-01 14:34:26,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2212 transitions. [2023-09-01 14:34:26,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:26,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2212 transitions. [2023-09-01 14:34:26,195 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-09-01 14:34:26,199 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-09-01 14:34:26,200 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-09-01 14:34:26,200 INFO L175 Difference]: Start difference. First operand has 203 places, 225 transitions, 2418 flow. Second operand 30 states and 2212 transitions. [2023-09-01 14:34:26,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 350 transitions, 4297 flow [2023-09-01 14:34:26,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 350 transitions, 4007 flow, removed 29 selfloop flow, removed 17 redundant places. [2023-09-01 14:34:26,272 INFO L231 Difference]: Finished difference. Result has 217 places, 232 transitions, 2628 flow [2023-09-01 14:34:26,272 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-09-01 14:34:26,274 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2023-09-01 14:34:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 232 transitions, 2628 flow [2023-09-01 14:34:26,274 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-09-01 14:34:26,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:26,275 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-09-01 14:34:26,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-09-01 14:34:26,483 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-09-01 14:34:26,484 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-09-01 14:34:26,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 988250302, now seen corresponding path program 8 times [2023-09-01 14:34:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896043796] [2023-09-01 14:34:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 14:34:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896043796] [2023-09-01 14:34:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896043796] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:34:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:34:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:34:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798994208] [2023-09-01 14:34:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:34:26,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:34:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:26,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:34:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:34:26,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 246 [2023-09-01 14:34:26,588 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-09-01 14:34:26,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:26,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 246 [2023-09-01 14:34:26,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:26,957 INFO L130 PetriNetUnfolder]: 1570/2906 cut-off events. [2023-09-01 14:34:26,957 INFO L131 PetriNetUnfolder]: For 47060/47105 co-relation queries the response was YES. [2023-09-01 14:34:26,967 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-09-01 14:34:26,978 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 190 selfloop transitions, 83 changer transitions 0/339 dead transitions. [2023-09-01 14:34:26,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 339 transitions, 4482 flow [2023-09-01 14:34:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:34:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:34:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-09-01 14:34:26,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172764227642277 [2023-09-01 14:34:26,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-09-01 14:34:26,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-09-01 14:34:26,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:26,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-09-01 14:34:26,980 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-09-01 14:34:26,981 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-09-01 14:34:26,981 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-09-01 14:34:26,981 INFO L175 Difference]: Start difference. First operand has 217 places, 232 transitions, 2628 flow. Second operand 4 states and 509 transitions. [2023-09-01 14:34:26,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 339 transitions, 4482 flow [2023-09-01 14:34:27,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 339 transitions, 4104 flow, removed 68 selfloop flow, removed 23 redundant places. [2023-09-01 14:34:27,038 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 3681 flow [2023-09-01 14:34:27,038 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-09-01 14:34:27,039 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2023-09-01 14:34:27,039 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 3681 flow [2023-09-01 14:34:27,039 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-09-01 14:34:27,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:27,039 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-09-01 14:34:27,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 14:34:27,040 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-09-01 14:34:27,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 279360084, now seen corresponding path program 9 times [2023-09-01 14:34:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870895060] [2023-09-01 14:34:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:27,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:27,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:27,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870895060] [2023-09-01 14:34:27,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870895060] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:27,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210705445] [2023-09-01 14:34:27,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 14:34:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:27,821 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:34:27,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 14:34:27,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-09-01 14:34:27,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:27,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-09-01 14:34:27,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:28,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:28,697 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-09-01 14:34:28,697 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-09-01 14:34:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:29,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210705445] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:29,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:29,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2023-09-01 14:34:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291558698] [2023-09-01 14:34:29,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-09-01 14:34:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-09-01 14:34:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2023-09-01 14:34:30,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 246 [2023-09-01 14:34:30,423 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-09-01 14:34:30,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:30,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 246 [2023-09-01 14:34:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:34:40,427 INFO L130 PetriNetUnfolder]: 9271/15383 cut-off events. [2023-09-01 14:34:40,427 INFO L131 PetriNetUnfolder]: For 211621/211621 co-relation queries the response was YES. [2023-09-01 14:34:40,480 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-09-01 14:34:40,532 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 794 selfloop transitions, 846 changer transitions 548/2188 dead transitions. [2023-09-01 14:34:40,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 2188 transitions, 29162 flow [2023-09-01 14:34:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2023-09-01 14:34:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2023-09-01 14:34:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 13348 transitions. [2023-09-01 14:34:40,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37164494932620556 [2023-09-01 14:34:40,549 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 13348 transitions. [2023-09-01 14:34:40,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 13348 transitions. [2023-09-01 14:34:40,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:34:40,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 13348 transitions. [2023-09-01 14:34:40,564 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-09-01 14:34:40,587 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-09-01 14:34:40,591 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-09-01 14:34:40,592 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 3681 flow. Second operand 146 states and 13348 transitions. [2023-09-01 14:34:40,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 2188 transitions, 29162 flow [2023-09-01 14:34:40,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 2188 transitions, 29070 flow, removed 46 selfloop flow, removed 0 redundant places. [2023-09-01 14:34:40,951 INFO L231 Difference]: Finished difference. Result has 396 places, 1034 transitions, 16521 flow [2023-09-01 14:34:40,951 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-09-01 14:34:40,951 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 365 predicate places. [2023-09-01 14:34:40,952 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1034 transitions, 16521 flow [2023-09-01 14:34:40,952 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-09-01 14:34:40,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:34:40,953 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-09-01 14:34:40,961 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-09-01 14:34:41,160 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-09-01 14:34:41,161 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-09-01 14:34:41,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:34:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash -761636766, now seen corresponding path program 10 times [2023-09-01 14:34:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:34:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37301921] [2023-09-01 14:34:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:34:41,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:34:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:34:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:34:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37301921] [2023-09-01 14:34:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37301921] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:34:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918202049] [2023-09-01 14:34:41,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 14:34:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:34:41,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:34:41,884 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-09-01 14:34:41,884 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-09-01 14:34:41,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 14:34:41,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:34:41,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2023-09-01 14:34:41,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:34:41,977 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-09-01 14:34:42,102 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-09-01 14:34:42,136 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-09-01 14:34:42,203 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-09-01 14:34:42,238 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-09-01 14:34:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:42,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:34:43,257 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-09-01 14:34:43,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:43,428 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-09-01 14:34:43,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:43,454 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-09-01 14:34:43,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:43,508 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-09-01 14:34:43,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:43,549 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-09-01 14:34:43,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:43,578 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-09-01 14:34:46,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:34:46,223 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-09-01 14:34:46,239 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:34:46,239 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-09-01 14:34:46,268 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:34:46,269 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-09-01 14:34:46,297 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:34:46,298 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-09-01 14:34:46,329 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:34:46,332 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-09-01 14:34:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:34:46,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918202049] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:34:46,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:34:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2023-09-01 14:34:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971157173] [2023-09-01 14:34:46,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:34:46,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-09-01 14:34:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:34:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-09-01 14:34:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1227, Unknown=9, NotChecked=74, Total=1560 [2023-09-01 14:34:46,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-09-01 14:34:46,977 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-09-01 14:34:46,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:34:46,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-09-01 14:34:46,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:35:07,991 INFO L130 PetriNetUnfolder]: 17366/29162 cut-off events. [2023-09-01 14:35:07,991 INFO L131 PetriNetUnfolder]: For 842542/842542 co-relation queries the response was YES. [2023-09-01 14:35:08,207 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-09-01 14:35:08,325 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 1236 selfloop transitions, 1274 changer transitions 1170/3680 dead transitions. [2023-09-01 14:35:08,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3680 transitions, 65247 flow [2023-09-01 14:35:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-09-01 14:35:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2023-09-01 14:35:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 8008 transitions. [2023-09-01 14:35:08,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28555127656539725 [2023-09-01 14:35:08,334 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 8008 transitions. [2023-09-01 14:35:08,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 8008 transitions. [2023-09-01 14:35:08,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:35:08,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 8008 transitions. [2023-09-01 14:35:08,343 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-09-01 14:35:08,359 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-09-01 14:35:08,361 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-09-01 14:35:08,361 INFO L175 Difference]: Start difference. First operand has 396 places, 1034 transitions, 16521 flow. Second operand 114 states and 8008 transitions. [2023-09-01 14:35:08,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 3680 transitions, 65247 flow [2023-09-01 14:35:17,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 3680 transitions, 52417 flow, removed 5830 selfloop flow, removed 35 redundant places. [2023-09-01 14:35:17,880 INFO L231 Difference]: Finished difference. Result has 518 places, 1809 transitions, 27234 flow [2023-09-01 14:35:17,880 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-09-01 14:35:17,881 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 487 predicate places. [2023-09-01 14:35:17,881 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 1809 transitions, 27234 flow [2023-09-01 14:35:17,881 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-09-01 14:35:17,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:35:17,881 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-09-01 14:35:17,886 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-09-01 14:35:18,081 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-09-01 14:35:18,082 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-09-01 14:35:18,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:35:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1759649258, now seen corresponding path program 11 times [2023-09-01 14:35:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:35:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892392767] [2023-09-01 14:35:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:35:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:35:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:35:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:35:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:35:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892392767] [2023-09-01 14:35:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892392767] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:35:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988291063] [2023-09-01 14:35:18,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 14:35:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:35:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:35:18,851 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-09-01 14:35:18,853 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-09-01 14:35:18,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-09-01 14:35:18,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:35:18,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2023-09-01 14:35:18,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:35:19,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-01 14:35:19,087 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-09-01 14:35:19,144 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-09-01 14:35:19,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:35:19,289 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-09-01 14:35:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:35:19,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:35:19,784 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-09-01 14:35:20,089 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-09-01 14:35:20,115 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-09-01 14:35:20,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:20,453 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-09-01 14:35:20,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:20,478 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-09-01 14:35:20,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:20,530 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-09-01 14:35:20,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:20,551 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-09-01 14:35:20,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:20,578 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-09-01 14:35:22,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:35:22,572 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-09-01 14:35:22,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:35:22,589 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:35:22,590 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-09-01 14:35:22,608 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:35:22,608 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-09-01 14:35:22,642 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-09-01 14:35:22,642 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-09-01 14:35:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 14:35:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988291063] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:35:22,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:35:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2023-09-01 14:35:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761524440] [2023-09-01 14:35:22,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:35:22,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:35:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:35:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:35:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=946, Unknown=9, NotChecked=198, Total=1332 [2023-09-01 14:35:22,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-09-01 14:35:22,874 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-09-01 14:35:22,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:35:22,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-09-01 14:35:22,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:35:23,577 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-09-01 14:35:23,970 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) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 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_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) .cse10)) is different from false [2023-09-01 14:35:24,578 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (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-09-01 14:35:41,900 INFO L130 PetriNetUnfolder]: 22794/38264 cut-off events. [2023-09-01 14:35:41,900 INFO L131 PetriNetUnfolder]: For 626168/626168 co-relation queries the response was YES. [2023-09-01 14:35:42,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297080 conditions, 38264 events. 22794/38264 cut-off events. For 626168/626168 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 301130 event pairs, 2183 based on Foata normal form. 1168/39432 useless extension candidates. Maximal degree in co-relation 296949. Up to 12083 conditions per place. [2023-09-01 14:35:42,434 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 1342 selfloop transitions, 1560 changer transitions 1296/4198 dead transitions. [2023-09-01 14:35:42,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 4198 transitions, 70603 flow [2023-09-01 14:35:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-09-01 14:35:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-09-01 14:35:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 5914 transitions. [2023-09-01 14:35:42,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2795424465872566 [2023-09-01 14:35:42,439 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 5914 transitions. [2023-09-01 14:35:42,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 5914 transitions. [2023-09-01 14:35:42,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:35:42,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 5914 transitions. [2023-09-01 14:35:42,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 68.76744186046511) internal successors, (5914), 86 states have internal predecessors, (5914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:35:42,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 246.0) internal successors, (21402), 87 states have internal predecessors, (21402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:35:42,456 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 246.0) internal successors, (21402), 87 states have internal predecessors, (21402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:35:42,456 INFO L175 Difference]: Start difference. First operand has 518 places, 1809 transitions, 27234 flow. Second operand 86 states and 5914 transitions. [2023-09-01 14:35:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 4198 transitions, 70603 flow [2023-09-01 14:35:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 4198 transitions, 68101 flow, removed 1167 selfloop flow, removed 22 redundant places. [2023-09-01 14:35:49,728 INFO L231 Difference]: Finished difference. Result has 608 places, 2212 transitions, 38828 flow [2023-09-01 14:35:49,729 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=864, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=38828, PETRI_PLACES=608, PETRI_TRANSITIONS=2212} [2023-09-01 14:35:49,729 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 577 predicate places. [2023-09-01 14:35:49,729 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 2212 transitions, 38828 flow [2023-09-01 14:35:49,730 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-09-01 14:35:49,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:35:49,730 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-09-01 14:35:49,737 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-09-01 14:35:49,934 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-09-01 14:35:49,934 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-09-01 14:35:49,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:35:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash -276382848, now seen corresponding path program 12 times [2023-09-01 14:35:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:35:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36117170] [2023-09-01 14:35:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:35:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:35:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:35:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:35:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:35:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36117170] [2023-09-01 14:35:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36117170] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:35:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091832083] [2023-09-01 14:35:50,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 14:35:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:35:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:35:50,733 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-09-01 14:35:50,735 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-09-01 14:35:50,888 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-09-01 14:35:50,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:35:50,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-09-01 14:35:50,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:35:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:35:51,112 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-09-01 14:35:51,354 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-09-01 14:35:51,354 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-09-01 14:35:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:35:51,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:35:52,852 INFO L321 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2023-09-01 14:35:52,852 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-09-01 14:35:52,902 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-09-01 14:35:52,902 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-09-01 14:35:52,952 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-09-01 14:35:52,953 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-09-01 14:35:53,001 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-09-01 14:35:53,001 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-09-01 14:35:53,049 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-09-01 14:35:53,050 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 [2023-09-01 14:43:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:43:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091832083] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:43:14,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:43:14,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2023-09-01 14:43:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396350604] [2023-09-01 14:43:14,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:43:14,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:43:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:43:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1110, Unknown=1, NotChecked=0, Total=1332 [2023-09-01 14:43:14,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-09-01 14:43:14,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 2212 transitions, 38828 flow. Second operand has 37 states, 37 states have (on average 70.0) internal successors, (2590), 37 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:14,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:14,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-09-01 14:43:14,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:43:44,537 INFO L130 PetriNetUnfolder]: 17990/30335 cut-off events. [2023-09-01 14:43:44,537 INFO L131 PetriNetUnfolder]: For 789865/789865 co-relation queries the response was YES. [2023-09-01 14:43:44,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272293 conditions, 30335 events. 17990/30335 cut-off events. For 789865/789865 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 230697 event pairs, 1879 based on Foata normal form. 882/31217 useless extension candidates. Maximal degree in co-relation 272131. Up to 9835 conditions per place. [2023-09-01 14:43:44,965 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 1032 selfloop transitions, 1520 changer transitions 733/3285 dead transitions. [2023-09-01 14:43:44,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 3285 transitions, 62913 flow [2023-09-01 14:43:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-09-01 14:43:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2023-09-01 14:43:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 8000 transitions. [2023-09-01 14:43:44,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30111412225233364 [2023-09-01 14:43:44,971 INFO L72 ComplementDD]: Start complementDD. Operand 108 states and 8000 transitions. [2023-09-01 14:43:44,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 8000 transitions. [2023-09-01 14:43:44,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:43:44,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 108 states and 8000 transitions. [2023-09-01 14:43:44,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 109 states, 108 states have (on average 74.07407407407408) internal successors, (8000), 108 states have internal predecessors, (8000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:44,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 109 states, 109 states have (on average 246.0) internal successors, (26814), 109 states have internal predecessors, (26814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:44,992 INFO L81 ComplementDD]: Finished complementDD. Result has 109 states, 109 states have (on average 246.0) internal successors, (26814), 109 states have internal predecessors, (26814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:44,992 INFO L175 Difference]: Start difference. First operand has 608 places, 2212 transitions, 38828 flow. Second operand 108 states and 8000 transitions. [2023-09-01 14:43:44,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 3285 transitions, 62913 flow [2023-09-01 14:43:55,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 3285 transitions, 57397 flow, removed 2091 selfloop flow, removed 64 redundant places. [2023-09-01 14:43:55,496 INFO L231 Difference]: Finished difference. Result has 619 places, 2123 transitions, 39580 flow [2023-09-01 14:43:55,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=24517, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=945, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=39580, PETRI_PLACES=619, PETRI_TRANSITIONS=2123} [2023-09-01 14:43:55,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 588 predicate places. [2023-09-01 14:43:55,498 INFO L495 AbstractCegarLoop]: Abstraction has has 619 places, 2123 transitions, 39580 flow [2023-09-01 14:43:55,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 70.0) internal successors, (2590), 37 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:55,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:43:55,499 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:43:55,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-01 14:43:55,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-09-01 14:43:55,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 14:43:55,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:43:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1964990127, now seen corresponding path program 13 times [2023-09-01 14:43:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:43:55,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793816813] [2023-09-01 14:43:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:43:55,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:43:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:43:57,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:43:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793816813] [2023-09-01 14:43:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793816813] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:43:57,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476922783] [2023-09-01 14:43:57,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 14:43:57,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:43:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:43:57,341 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:43:57,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 14:43:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:43:57,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-09-01 14:43:57,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:43:57,596 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-09-01 14:43:57,597 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 25 treesize of output 10 [2023-09-01 14:43:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:43:57,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:43:57,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:43:57,804 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-09-01 14:43:58,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:43:58,051 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 211 treesize of output 155 [2023-09-01 14:43:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:43:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476922783] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:43:58,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:43:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 32 [2023-09-01 14:43:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433965632] [2023-09-01 14:43:58,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:43:58,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 14:43:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:43:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 14:43:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2023-09-01 14:43:59,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 246 [2023-09-01 14:43:59,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 2123 transitions, 39580 flow. Second operand has 33 states, 33 states have (on average 85.03030303030303) internal successors, (2806), 33 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:43:59,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:43:59,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 246 [2023-09-01 14:43:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:44:13,777 INFO L130 PetriNetUnfolder]: 16703/29520 cut-off events. [2023-09-01 14:44:13,777 INFO L131 PetriNetUnfolder]: For 732928/732961 co-relation queries the response was YES. [2023-09-01 14:44:14,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264739 conditions, 29520 events. 16703/29520 cut-off events. For 732928/732961 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 245306 event pairs, 2143 based on Foata normal form. 229/28635 useless extension candidates. Maximal degree in co-relation 264574. Up to 9053 conditions per place. [2023-09-01 14:44:14,330 INFO L137 encePairwiseOnDemand]: 235/246 looper letters, 942 selfloop transitions, 1263 changer transitions 512/2897 dead transitions. [2023-09-01 14:44:14,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 2897 transitions, 59527 flow [2023-09-01 14:44:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-09-01 14:44:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-09-01 14:44:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3551 transitions. [2023-09-01 14:44:14,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608739837398374 [2023-09-01 14:44:14,333 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3551 transitions. [2023-09-01 14:44:14,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3551 transitions. [2023-09-01 14:44:14,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:44:14,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3551 transitions. [2023-09-01 14:44:14,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 88.775) internal successors, (3551), 40 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:14,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 246.0) internal successors, (10086), 41 states have internal predecessors, (10086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:14,340 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 246.0) internal successors, (10086), 41 states have internal predecessors, (10086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:14,340 INFO L175 Difference]: Start difference. First operand has 619 places, 2123 transitions, 39580 flow. Second operand 40 states and 3551 transitions. [2023-09-01 14:44:14,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 2897 transitions, 59527 flow [2023-09-01 14:44:21,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 2897 transitions, 56204 flow, removed 1014 selfloop flow, removed 25 redundant places. [2023-09-01 14:44:21,508 INFO L231 Difference]: Finished difference. Result has 644 places, 2229 transitions, 42401 flow [2023-09-01 14:44:21,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=36795, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=42401, PETRI_PLACES=644, PETRI_TRANSITIONS=2229} [2023-09-01 14:44:21,509 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 613 predicate places. [2023-09-01 14:44:21,509 INFO L495 AbstractCegarLoop]: Abstraction has has 644 places, 2229 transitions, 42401 flow [2023-09-01 14:44:21,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 85.03030303030303) internal successors, (2806), 33 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:21,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:44:21,509 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:44:21,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-09-01 14:44:21,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-09-01 14:44:21,710 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 14:44:21,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:44:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2107388823, now seen corresponding path program 14 times [2023-09-01 14:44:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:44:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286926454] [2023-09-01 14:44:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:44:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:44:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:44:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:44:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:44:22,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286926454] [2023-09-01 14:44:22,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286926454] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:44:22,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550851517] [2023-09-01 14:44:22,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 14:44:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:44:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:44:22,838 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:44:22,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 14:44:22,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 14:44:22,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:44:22,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2023-09-01 14:44:22,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:44:23,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:44:23,191 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 32 treesize of output 32 [2023-09-01 14:44:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:44:23,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:44:23,539 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))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_780 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_780 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1)))))) is different from false [2023-09-01 14:44:23,734 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-09-01 14:44:23,735 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 282 treesize of output 236 [2023-09-01 14:44:23,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:23,746 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 71 treesize of output 58 [2023-09-01 14:44:23,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:44:23,756 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 58 treesize of output 45 [2023-09-01 14:44:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-09-01 14:44:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550851517] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:44:24,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:44:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2023-09-01 14:44:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697522923] [2023-09-01 14:44:24,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:44:24,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-09-01 14:44:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:44:24,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-09-01 14:44:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1146, Unknown=13, NotChecked=70, Total=1406 [2023-09-01 14:44:24,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-09-01 14:44:24,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 2229 transitions, 42401 flow. Second operand has 38 states, 38 states have (on average 65.92105263157895) internal successors, (2505), 38 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:24,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:44:24,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-09-01 14:44:24,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:44:25,875 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse7 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse7) (not (= (+ .cse8 1) 0))) (or .cse7 (not (= .cse8 1)))))) (.cse1 (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_780 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_780 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))))) (and (<= c_~v_assert~0 1) (or .cse0 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|))) is different from false [2023-09-01 14:44:26,759 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8)) (.cse6 (+ c_~queue~0.offset .cse8 4))) (let ((.cse0 (forall ((v_ArrVal_780 (Array Int Int))) (<= 0 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6)))))) (.cse3 (forall ((v_ArrVal_780 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))) 1)))) (and .cse0 (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (and .cse0 .cse3)) .cse3)))) is different from false [2023-09-01 14:44:28,008 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_780 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (forall ((v_ArrVal_780 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_780) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) is different from false [2023-09-01 14:44:48,235 INFO L130 PetriNetUnfolder]: 30649/51267 cut-off events. [2023-09-01 14:44:48,235 INFO L131 PetriNetUnfolder]: For 1496188/1496188 co-relation queries the response was YES. [2023-09-01 14:44:49,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490116 conditions, 51267 events. 30649/51267 cut-off events. For 1496188/1496188 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 417240 event pairs, 3988 based on Foata normal form. 418/51685 useless extension candidates. Maximal degree in co-relation 489948. Up to 17296 conditions per place. [2023-09-01 14:44:49,617 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 2975 selfloop transitions, 1199 changer transitions 562/4736 dead transitions. [2023-09-01 14:44:49,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 4736 transitions, 99308 flow [2023-09-01 14:44:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-09-01 14:44:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-09-01 14:44:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2782 transitions. [2023-09-01 14:44:49,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2899728997289973 [2023-09-01 14:44:49,619 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2782 transitions. [2023-09-01 14:44:49,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2782 transitions. [2023-09-01 14:44:49,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:44:49,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2782 transitions. [2023-09-01 14:44:49,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 71.33333333333333) internal successors, (2782), 39 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:49,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 246.0) internal successors, (9840), 40 states have internal predecessors, (9840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:49,626 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 246.0) internal successors, (9840), 40 states have internal predecessors, (9840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:44:49,626 INFO L175 Difference]: Start difference. First operand has 644 places, 2229 transitions, 42401 flow. Second operand 39 states and 2782 transitions. [2023-09-01 14:44:49,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 4736 transitions, 99308 flow [2023-09-01 14:45:06,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 4736 transitions, 93796 flow, removed 1120 selfloop flow, removed 23 redundant places. [2023-09-01 14:45:06,738 INFO L231 Difference]: Finished difference. Result has 682 places, 2890 transitions, 58737 flow [2023-09-01 14:45:06,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=39973, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=650, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=58737, PETRI_PLACES=682, PETRI_TRANSITIONS=2890} [2023-09-01 14:45:06,740 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 651 predicate places. [2023-09-01 14:45:06,740 INFO L495 AbstractCegarLoop]: Abstraction has has 682 places, 2890 transitions, 58737 flow [2023-09-01 14:45:06,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 65.92105263157895) internal successors, (2505), 38 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:45:06,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:45:06,740 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:45:06,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-09-01 14:45:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:45:06,947 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 14:45:06,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:45:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2009233053, now seen corresponding path program 15 times [2023-09-01 14:45:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:45:06,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733814861] [2023-09-01 14:45:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:45:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:45:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:45:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:45:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:45:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733814861] [2023-09-01 14:45:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733814861] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:45:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020304021] [2023-09-01 14:45:08,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 14:45:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:45:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:45:08,548 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 14:45:08,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-09-01 14:45:08,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-09-01 14:45:08,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:45:08,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2023-09-01 14:45:08,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:45:08,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:45:08,944 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 32 treesize of output 32 [2023-09-01 14:45:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-09-01 14:45:09,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:45:09,156 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-09-01 14:45:09,182 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))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-09-01 14:45:09,201 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))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)) 1))))) is different from false [2023-09-01 14:45:09,403 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-09-01 14:45:09,404 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 286 treesize of output 224 [2023-09-01 14:45:09,412 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 59 treesize of output 52 [2023-09-01 14:45:09,419 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 52 treesize of output 45 [2023-09-01 14:45:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2023-09-01 14:45:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020304021] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:45:09,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:45:09,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 34 [2023-09-01 14:45:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819993804] [2023-09-01 14:45:09,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:45:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 14:45:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:45:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 14:45:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=868, Unknown=6, NotChecked=186, Total=1190 [2023-09-01 14:45:09,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-09-01 14:45:09,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 2890 transitions, 58737 flow. Second operand has 35 states, 35 states have (on average 64.2) internal successors, (2247), 35 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:45:09,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:45:09,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-09-01 14:45:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:45:11,929 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse4))))))) (= (mod c_~v_assert~0 256) 0))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-09-01 14:45:12,301 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (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))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)) 1))))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-09-01 14:45:12,343 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse4))))))) (= (mod c_~v_assert~0 256) 0)))) is different from false [2023-09-01 14:45:13,504 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (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))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse2)) 1))))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-09-01 14:45:15,202 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_833 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_833 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_833) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) is different from false [2023-09-01 14:46:14,619 INFO L130 PetriNetUnfolder]: 64458/106079 cut-off events. [2023-09-01 14:46:14,619 INFO L131 PetriNetUnfolder]: For 4962215/4962215 co-relation queries the response was YES. [2023-09-01 14:46:17,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252404 conditions, 106079 events. 64458/106079 cut-off events. For 4962215/4962215 co-relation queries the response was YES. Maximal size of possible extension queue 3884. Compared 950665 event pairs, 7424 based on Foata normal form. 310/106389 useless extension candidates. Maximal degree in co-relation 1252216. Up to 43086 conditions per place. [2023-09-01 14:46:18,057 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 4606 selfloop transitions, 3164 changer transitions 353/8123 dead transitions. [2023-09-01 14:46:18,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 8123 transitions, 182427 flow [2023-09-01 14:46:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-09-01 14:46:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-09-01 14:46:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 4821 transitions. [2023-09-01 14:46:18,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2760219855719684 [2023-09-01 14:46:18,061 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 4821 transitions. [2023-09-01 14:46:18,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 4821 transitions. [2023-09-01 14:46:18,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:46:18,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 4821 transitions. [2023-09-01 14:46:18,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 67.90140845070422) internal successors, (4821), 71 states have internal predecessors, (4821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:46:18,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 246.0) internal successors, (17712), 72 states have internal predecessors, (17712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:46:18,072 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 246.0) internal successors, (17712), 72 states have internal predecessors, (17712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:46:18,072 INFO L175 Difference]: Start difference. First operand has 682 places, 2890 transitions, 58737 flow. Second operand 71 states and 4821 transitions. [2023-09-01 14:46:18,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 8123 transitions, 182427 flow Killed by 15