./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.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-two-queue.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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --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:47:15,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 14:47:15,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 14:47:15,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 14:47:15,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 14:47:15,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 14:47:15,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 14:47:15,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 14:47:15,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 14:47:15,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 14:47:15,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 14:47:15,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 14:47:15,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 14:47:15,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 14:47:15,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 14:47:15,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 14:47:15,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 14:47:15,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 14:47:15,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 14:47:15,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 14:47:15,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 14:47:15,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 14:47:15,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 14:47:15,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 14:47:15,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 14:47:15,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 14:47:15,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 14:47:15,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 14:47:15,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 14:47:15,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 14:47:15,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 14:47:15,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 14:47:15,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 14:47:15,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 14:47:15,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 14:47:15,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 14:47:15,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 14:47:15,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 14:47:15,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 14:47:15,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 14:47:15,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 14:47:15,694 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:47:15,730 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 14:47:15,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 14:47:15,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 14:47:15,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 14:47:15,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 14:47:15,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 14:47:15,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 14:47:15,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 14:47:15,734 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 14:47:15,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 14:47:15,734 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 14:47:15,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 14:47:15,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 14:47:15,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 14:47:15,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 14:47:15,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 14:47:15,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 14:47:15,736 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 14:47:15,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 14:47:15,736 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 14:47:15,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 14:47:15,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 14:47:15,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 14:47:15,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 14:47:15,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:47:15,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 14:47:15,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 14:47:15,739 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 14:47:15,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 14:47:15,739 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 14:47:15,739 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 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:47:16,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 14:47:16,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 14:47:16,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 14:47:16,029 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 14:47:16,030 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 14:47:16,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-01 14:47:17,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 14:47:17,392 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 14:47:17,393 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-01 14:47:17,397 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b723ae1ca/9d7cf3f1c3034bdb96b08a0c2f39fa77/FLAG62b4b65fd [2023-09-01 14:47:17,407 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b723ae1ca/9d7cf3f1c3034bdb96b08a0c2f39fa77 [2023-09-01 14:47:17,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 14:47:17,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 14:47:17,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 14:47:17,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 14:47:17,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 14:47:17,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f74fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17, skipping insertion in model container [2023-09-01 14:47:17,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 14:47:17,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 14:47:17,587 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-two-queue.wvr.c[2987,3000] [2023-09-01 14:47:17,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:47:17,602 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 14:47:17,618 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-two-queue.wvr.c[2987,3000] [2023-09-01 14:47:17,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 14:47:17,627 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:47:17,627 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 14:47:17,633 INFO L208 MainTranslator]: Completed translation [2023-09-01 14:47:17,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17 WrapperNode [2023-09-01 14:47:17,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 14:47:17,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 14:47:17,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 14:47:17,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 14:47:17,640 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:47:17" (1/1) ... [2023-09-01 14:47:17,646 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:47:17" (1/1) ... [2023-09-01 14:47:17,666 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-09-01 14:47:17,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 14:47:17,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 14:47:17,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 14:47:17,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 14:47:17,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,687 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 14:47:17,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 14:47:17,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 14:47:17,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 14:47:17,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (1/1) ... [2023-09-01 14:47:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 14:47:17,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:47:17,717 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:47:17,745 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:47:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 14:47:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 14:47:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 14:47:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 14:47:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 14:47:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 14:47:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 14:47:17,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 14:47:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 14:47:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 14:47:17,788 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:47:17,951 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 14:47:17,952 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 14:47:18,256 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 14:47:18,357 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 14:47:18,359 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 14:47:18,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:47:18 BoogieIcfgContainer [2023-09-01 14:47:18,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 14:47:18,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 14:47:18,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 14:47:18,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 14:47:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:47:17" (1/3) ... [2023-09-01 14:47:18,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459d3220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:47:18, skipping insertion in model container [2023-09-01 14:47:18,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:47:17" (2/3) ... [2023-09-01 14:47:18,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459d3220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:47:18, skipping insertion in model container [2023-09-01 14:47:18,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:47:18" (3/3) ... [2023-09-01 14:47:18,370 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-09-01 14:47:18,376 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 14:47:18,381 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 14:47:18,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 14:47:18,382 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 14:47:18,439 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 14:47:18,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 170 transitions, 356 flow [2023-09-01 14:47:18,546 INFO L130 PetriNetUnfolder]: 13/168 cut-off events. [2023-09-01 14:47:18,547 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 14:47:18,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 13/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-09-01 14:47:18,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 170 transitions, 356 flow [2023-09-01 14:47:18,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 160 transitions, 332 flow [2023-09-01 14:47:18,558 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 14:47:18,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 160 transitions, 332 flow [2023-09-01 14:47:18,567 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 160 transitions, 332 flow [2023-09-01 14:47:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 160 transitions, 332 flow [2023-09-01 14:47:18,608 INFO L130 PetriNetUnfolder]: 13/160 cut-off events. [2023-09-01 14:47:18,608 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 14:47:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 13/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-09-01 14:47:18,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-09-01 14:47:23,660 INFO L134 LiptonReduction]: Checked pairs total: 763 [2023-09-01 14:47:23,661 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-09-01 14:47:23,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 14:47:23,677 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;@2d96dd13, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 14:47:23,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-09-01 14:47:23,682 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2023-09-01 14:47:23,683 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 14:47:23,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:23,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:23,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:23,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 219698779, now seen corresponding path program 1 times [2023-09-01 14:47:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322409452] [2023-09-01 14:47:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:24,102 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:47:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:24,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322409452] [2023-09-01 14:47:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322409452] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 14:47:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271426307] [2023-09-01 14:47:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:24,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 14:47:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 14:47:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 14:47:24,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-09-01 14:47:24,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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:47:24,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:24,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-09-01 14:47:24,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:24,246 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2023-09-01 14:47:24,249 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-09-01 14:47:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-09-01 14:47:24,251 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-09-01 14:47:24,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-09-01 14:47:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 14:47:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 14:47:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-09-01 14:47:24,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750499001996008 [2023-09-01 14:47:24,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-09-01 14:47:24,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-09-01 14:47:24,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:24,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-09-01 14:47:24,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:47:24,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:47:24,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:47:24,279 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 476 transitions. [2023-09-01 14:47:24,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-09-01 14:47:24,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 14:47:24,283 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-09-01 14:47:24,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-09-01 14:47:24,287 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-09-01 14:47:24,287 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-09-01 14:47:24,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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:47:24,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:24,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:24,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 14:47:24,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:24,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1594831125, now seen corresponding path program 1 times [2023-09-01 14:47:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611551532] [2023-09-01 14:47:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:24,374 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:47:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:24,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611551532] [2023-09-01 14:47:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611551532] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:47:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848327629] [2023-09-01 14:47:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:24,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:47:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:47:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:47:24,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-09-01 14:47:24,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:24,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:24,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-09-01 14:47:24,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:24,544 INFO L130 PetriNetUnfolder]: 102/194 cut-off events. [2023-09-01 14:47:24,544 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-09-01 14:47:24,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 194 events. 102/194 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 9 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 114. Up to 76 conditions per place. [2023-09-01 14:47:24,547 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 41 selfloop transitions, 6 changer transitions 1/48 dead transitions. [2023-09-01 14:47:24,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 48 transitions, 224 flow [2023-09-01 14:47:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 14:47:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 14:47:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2023-09-01 14:47:24,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616766467065868 [2023-09-01 14:47:24,553 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 771 transitions. [2023-09-01 14:47:24,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 771 transitions. [2023-09-01 14:47:24,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:24,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 771 transitions. [2023-09-01 14:47:24,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 0 states have call successors, (0), 0 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:47:24,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 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:47:24,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 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:47:24,562 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 771 transitions. [2023-09-01 14:47:24,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 48 transitions, 224 flow [2023-09-01 14:47:24,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 14:47:24,565 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 99 flow [2023-09-01 14:47:24,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-09-01 14:47:24,566 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2023-09-01 14:47:24,566 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 99 flow [2023-09-01 14:47:24,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:24,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:24,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:24,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 14:47:24,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:24,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash -723769805, now seen corresponding path program 2 times [2023-09-01 14:47:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087217218] [2023-09-01 14:47:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:24,694 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:47:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087217218] [2023-09-01 14:47:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087217218] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:47:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468287318] [2023-09-01 14:47:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:24,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:47:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:47:24,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:47:24,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-09-01 14:47:24,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:24,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:24,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-09-01 14:47:24,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:24,790 INFO L130 PetriNetUnfolder]: 89/165 cut-off events. [2023-09-01 14:47:24,790 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-09-01 14:47:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 165 events. 89/165 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 15 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 192. Up to 120 conditions per place. [2023-09-01 14:47:24,792 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 26 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2023-09-01 14:47:24,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 227 flow [2023-09-01 14:47:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:47:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:47:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2023-09-01 14:47:24,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595808383233533 [2023-09-01 14:47:24,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2023-09-01 14:47:24,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2023-09-01 14:47:24,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:24,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2023-09-01 14:47:24,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 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:47:24,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:24,800 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:24,800 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 99 flow. Second operand 4 states and 614 transitions. [2023-09-01 14:47:24,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 227 flow [2023-09-01 14:47:24,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 14:47:24,802 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 110 flow [2023-09-01 14:47:24,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-09-01 14:47:24,803 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-09-01 14:47:24,803 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 110 flow [2023-09-01 14:47:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:24,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:24,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:24,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 14:47:24,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:24,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash 521491958, now seen corresponding path program 1 times [2023-09-01 14:47:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:24,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367563798] [2023-09-01 14:47:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:24,883 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:47:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:24,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367563798] [2023-09-01 14:47:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367563798] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:24,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:24,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:47:24,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64807535] [2023-09-01 14:47:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:24,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:47:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:47:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:47:24,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 334 [2023-09-01 14:47:24,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:24,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:24,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 334 [2023-09-01 14:47:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:24,990 INFO L130 PetriNetUnfolder]: 98/173 cut-off events. [2023-09-01 14:47:24,990 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-09-01 14:47:24,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 173 events. 98/173 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 18 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 214. Up to 122 conditions per place. [2023-09-01 14:47:24,992 INFO L137 encePairwiseOnDemand]: 328/334 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-09-01 14:47:24,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 236 flow [2023-09-01 14:47:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 14:47:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 14:47:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2023-09-01 14:47:25,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538922155688623 [2023-09-01 14:47:25,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2023-09-01 14:47:25,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2023-09-01 14:47:25,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:25,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2023-09-01 14:47:25,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 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:47:25,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 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:47:25,009 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 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:47:25,009 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 110 flow. Second operand 5 states and 758 transitions. [2023-09-01 14:47:25,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 236 flow [2023-09-01 14:47:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 214 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 14:47:25,014 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 112 flow [2023-09-01 14:47:25,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-09-01 14:47:25,016 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2023-09-01 14:47:25,016 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 112 flow [2023-09-01 14:47:25,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 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:47:25,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:25,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 14:47:25,018 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:25,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -44837542, now seen corresponding path program 1 times [2023-09-01 14:47:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487637966] [2023-09-01 14:47:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:25,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:47:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487637966] [2023-09-01 14:47:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487637966] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 14:47:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479958529] [2023-09-01 14:47:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:47:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:47:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:47:25,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-09-01 14:47:25,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:47:25,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:25,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-09-01 14:47:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:25,261 INFO L130 PetriNetUnfolder]: 102/188 cut-off events. [2023-09-01 14:47:25,261 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2023-09-01 14:47:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 188 events. 102/188 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 61 based on Foata normal form. 8/192 useless extension candidates. Maximal degree in co-relation 308. Up to 174 conditions per place. [2023-09-01 14:47:25,263 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 24 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2023-09-01 14:47:25,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 205 flow [2023-09-01 14:47:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:47:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:47:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2023-09-01 14:47:25,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476047904191617 [2023-09-01 14:47:25,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2023-09-01 14:47:25,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2023-09-01 14:47:25,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:25,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2023-09-01 14:47:25,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:47:25,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:25,271 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:25,272 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 112 flow. Second operand 4 states and 598 transitions. [2023-09-01 14:47:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 205 flow [2023-09-01 14:47:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 14:47:25,274 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 120 flow [2023-09-01 14:47:25,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-09-01 14:47:25,276 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2023-09-01 14:47:25,277 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 120 flow [2023-09-01 14:47:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:47:25,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:25,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:47:25,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 14:47:25,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:25,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1961656, now seen corresponding path program 1 times [2023-09-01 14:47:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891309597] [2023-09-01 14:47:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 14:47:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891309597] [2023-09-01 14:47:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891309597] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 14:47:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882030768] [2023-09-01 14:47:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 14:47:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 14:47:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 14:47:25,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 334 [2023-09-01 14:47:25,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:47:25,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:25,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 334 [2023-09-01 14:47:25,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:25,474 INFO L130 PetriNetUnfolder]: 99/183 cut-off events. [2023-09-01 14:47:25,474 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-09-01 14:47:25,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 183 events. 99/183 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 479 event pairs, 59 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 616. Up to 175 conditions per place. [2023-09-01 14:47:25,476 INFO L137 encePairwiseOnDemand]: 329/334 looper letters, 25 selfloop transitions, 2 changer transitions 6/33 dead transitions. [2023-09-01 14:47:25,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 207 flow [2023-09-01 14:47:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 14:47:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 14:47:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-09-01 14:47:25,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44610778443113774 [2023-09-01 14:47:25,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-09-01 14:47:25,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-09-01 14:47:25,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:25,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-09-01 14:47:25,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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:47:25,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:25,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:47:25,483 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 120 flow. Second operand 4 states and 596 transitions. [2023-09-01 14:47:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 207 flow [2023-09-01 14:47:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-09-01 14:47:25,485 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 132 flow [2023-09-01 14:47:25,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-09-01 14:47:25,485 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2023-09-01 14:47:25,486 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 132 flow [2023-09-01 14:47:25,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 14:47:25,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:25,486 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:47:25,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 14:47:25,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:25,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1784763123, now seen corresponding path program 1 times [2023-09-01 14:47:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048876323] [2023-09-01 14:47:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 14:47:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048876323] [2023-09-01 14:47:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048876323] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 14:47:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 14:47:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 14:47:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903594785] [2023-09-01 14:47:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 14:47:25,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 14:47:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 14:47:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 14:47:25,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-09-01 14:47:25,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 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:47:25,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:47:25,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-09-01 14:47:25,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:47:25,657 INFO L130 PetriNetUnfolder]: 77/140 cut-off events. [2023-09-01 14:47:25,658 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-09-01 14:47:25,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 140 events. 77/140 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 327 event pairs, 19 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 487. Up to 123 conditions per place. [2023-09-01 14:47:25,659 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-09-01 14:47:25,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 198 flow [2023-09-01 14:47:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 14:47:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 14:47:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-09-01 14:47:25,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660678642714571 [2023-09-01 14:47:25,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-09-01 14:47:25,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-09-01 14:47:25,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:47:25,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-09-01 14:47:25,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 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:47:25,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:47:25,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:47:25,665 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 132 flow. Second operand 3 states and 467 transitions. [2023-09-01 14:47:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 198 flow [2023-09-01 14:47:25,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 186 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-09-01 14:47:25,666 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 139 flow [2023-09-01 14:47:25,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-09-01 14:47:25,667 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2023-09-01 14:47:25,667 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 139 flow [2023-09-01 14:47:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 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:47:25,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:47:25,668 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:47:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 14:47:25,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:47:25,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:47:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 761354163, now seen corresponding path program 2 times [2023-09-01 14:47:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:47:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677562966] [2023-09-01 14:47:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:47:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:47:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:47:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:47:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:47:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677562966] [2023-09-01 14:47:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677562966] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:47:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878403071] [2023-09-01 14:47:26,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 14:47:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:47:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:47:26,862 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:47:26,889 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:47:26,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 14:47:26,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:47:26,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-09-01 14:47:26,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:47:27,191 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 15 treesize of output 11 [2023-09-01 14:47:27,261 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:47:27,357 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:47:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:47:27,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:47:28,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:28,354 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 118 treesize of output 82 [2023-09-01 14:47:28,429 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-09-01 14:47:28,429 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 1112 treesize of output 1048 [2023-09-01 14:47:28,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:28,521 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 502 treesize of output 462 [2023-09-01 14:47:28,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:28,582 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 382 treesize of output 402 [2023-09-01 14:47:58,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:58,067 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 116 treesize of output 80 [2023-09-01 14:47:58,100 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-09-01 14:47:58,101 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 550 treesize of output 493 [2023-09-01 14:47:58,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:47:58,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:47:58,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:58,131 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 470 treesize of output 366 [2023-09-01 14:47:58,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:47:58,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:47:58,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:47:58,153 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 350 treesize of output 306 [2023-09-01 14:47:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:47:58,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878403071] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:47:58,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:47:58,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2023-09-01 14:47:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224907452] [2023-09-01 14:47:58,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:47:58,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 14:47:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:47:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 14:47:58,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=760, Unknown=1, NotChecked=0, Total=870 [2023-09-01 14:48:00,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-09-01 14:48:00,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 139 flow. Second operand has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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:48:00,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:48:00,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-09-01 14:48:00,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:48:09,711 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 74 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:48:12,680 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2023-09-01 14:48:12,680 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2023-09-01 14:48:12,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 446 events. 244/446 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1739 event pairs, 6 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 1404. Up to 173 conditions per place. [2023-09-01 14:48:12,683 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 76 selfloop transitions, 58 changer transitions 2/136 dead transitions. [2023-09-01 14:48:12,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 136 transitions, 907 flow [2023-09-01 14:48:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-01 14:48:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-09-01 14:48:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2316 transitions. [2023-09-01 14:48:12,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25681969394544246 [2023-09-01 14:48:12,694 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2316 transitions. [2023-09-01 14:48:12,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2316 transitions. [2023-09-01 14:48:12,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:48:12,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2316 transitions. [2023-09-01 14:48:12,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 85.77777777777777) internal successors, (2316), 27 states have internal predecessors, (2316), 0 states have call successors, (0), 0 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:48:12,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 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:48:12,714 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 334.0) internal successors, (9352), 28 states have internal predecessors, (9352), 0 states have call successors, (0), 0 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:48:12,714 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 139 flow. Second operand 27 states and 2316 transitions. [2023-09-01 14:48:12,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 136 transitions, 907 flow [2023-09-01 14:48:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 136 transitions, 887 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 14:48:12,720 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 664 flow [2023-09-01 14:48:12,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=664, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-09-01 14:48:12,722 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2023-09-01 14:48:12,722 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 664 flow [2023-09-01 14:48:12,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 82.76666666666667) internal successors, (2483), 30 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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:48:12,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:48:12,723 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:48:12,739 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:48:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:48:12,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:48:12,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:48:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1927973413, now seen corresponding path program 3 times [2023-09-01 14:48:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:48:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802270289] [2023-09-01 14:48:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:48:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:48:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:48:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:48:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:48:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802270289] [2023-09-01 14:48:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802270289] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:48:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335254411] [2023-09-01 14:48:14,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 14:48:14,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:48:14,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:48:14,199 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:48:14,202 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:48:14,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 14:48:14,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:48:14,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 73 conjunts are in the unsatisfiable core [2023-09-01 14:48:14,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:48:14,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:48:14,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:48:14,329 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 14:48:14,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 14:48:14,399 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 15 treesize of output 11 [2023-09-01 14:48:14,463 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:48:14,464 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 11 treesize of output 11 [2023-09-01 14:48:14,576 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 11 treesize of output 7 [2023-09-01 14:48:14,654 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:48:14,731 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:48:15,140 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 0 case distinctions, treesize of input 54 treesize of output 20 [2023-09-01 14:48:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:48:15,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:48:16,594 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-09-01 14:48:16,594 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 2 case distinctions, treesize of input 150 treesize of output 88 [2023-09-01 14:48:16,677 INFO L321 Elim1Store]: treesize reduction 4, result has 94.7 percent of original size [2023-09-01 14:48:16,678 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 480 treesize of output 499 [2023-09-01 14:48:16,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:48:16,722 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 154 treesize of output 174 [2023-09-01 14:48:16,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:48:16,755 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 149 treesize of output 153 [2023-09-01 14:48:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:48:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335254411] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:48:19,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:48:19,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-09-01 14:48:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195455944] [2023-09-01 14:48:19,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:48:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:48:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:48:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:48:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1163, Unknown=6, NotChecked=0, Total=1332 [2023-09-01 14:48:21,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-09-01 14:48:21,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 664 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 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:48:21,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:48:21,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-09-01 14:48:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:48:25,001 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_~q2_front~0 4))) (let ((.cse11 (select |c_#memory_int| c_~q2~0.base)) (.cse19 (+ c_~q2~0.offset .cse41))) (let ((.cse14 (+ c_~i~0 1)) (.cse42 (* c_~q2_back~0 4)) (.cse20 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse43 (select |c_#memory_int| c_~q1~0.base)) (.cse17 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse15 (select .cse11 .cse19))) (let ((.cse0 (< .cse15 c_~i~0)) (.cse9 (not (= (select .cse43 .cse17) c_~j~0))) (.cse13 (select .cse43 .cse20)) (.cse1 (< (+ .cse15 1) c_~N~0)) (.cse12 (+ .cse42 c_~q2~0.offset)) (.cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (< c_~j~0 .cse14)) (.cse4 (<= c_~n1~0 c_~q1_back~0)) (.cse5 (< c_~q2_back~0 0)) (.cse28 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (<= c_~n2~0 c_~q2_back~0)) (.cse8 (< c_~q1_back~0 0)) (.cse2 (<= c_~n2~0 c_~q2_front~0)) (.cse3 (< c_~q2_front~0 0))) (and (<= c_~i~0 c_~j~0) (or (and .cse0 (or (< c_~i~0 (+ c_~N~0 1)) .cse1)) (< c_~i~0 c_~N~0) .cse2 .cse3) (or (< 0 c_~q2_front~0) .cse4 .cse5 (and .cse6 (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse7 .cse8 .cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or .cse9 .cse4 .cse5 .cse10 .cse8 .cse2 .cse3 (not (= c_~i~0 (select .cse11 .cse12))) (and (or (< .cse13 .cse14) .cse0) (or (< .cse15 .cse14) (< .cse13 c_~i~0)))) (or .cse9 .cse4 (and (or (< .cse15 c_~N~0) (< (+ .cse13 1) c_~N~0)) (or (< .cse13 c_~N~0) .cse1)) .cse8 .cse2 .cse3) (or .cse4 .cse5 .cse10 .cse8 .cse2 .cse3 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse21 c_~q1~0.base)) (.cse18 (select .cse21 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse17))) (< (select .cse18 .cse19) .cse14) (< (select .cse16 .cse20) c_~i~0) (not (= c_~i~0 (select .cse18 .cse12))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse23 (select .cse24 c_~q1~0.base)) (.cse22 (select .cse24 c_~q2~0.base))) (or (< (select .cse22 .cse19) c_~i~0) (< (select .cse23 .cse20) .cse14) (not (= c_~j~0 (select .cse23 .cse17))) (not (= c_~i~0 (select .cse22 .cse12))))))))) (or .cse4 .cse5 .cse10 .cse7 .cse8 .cse2 .cse3 (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (select .cse29 c_~q1~0.base))) (or (not (= (select .cse25 .cse17) c_~j~0)) (< (select .cse26 .cse27) .cse14) (not (= (select .cse26 .cse28) c_~i~0)) (< (select .cse25 .cse20) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse30 .cse31 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse32 (select .cse34 c_~q1~0.base)) (.cse33 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse32 .cse17) c_~j~0)) (< (select .cse32 .cse20) .cse14) (not (= (select .cse33 .cse28) c_~i~0)) (< (select .cse33 .cse27) c_~i~0)))))))) .cse6 (or .cse4 .cse5 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse36 (select .cse37 c_~q1~0.base)) (.cse35 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 .cse28) c_~i~0)) (not (= (select .cse36 .cse17) c_~j~0)) (< (select .cse36 .cse20) c_~i~0) (< (select .cse35 .cse27) .cse14))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse38 (select .cse40 c_~q1~0.base)) (.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse38 .cse20) .cse14) (not (= (select .cse39 .cse28) c_~i~0)) (not (= (select .cse38 .cse17) c_~j~0)) (< (select .cse39 .cse27) c_~i~0)))))) .cse10 .cse8 .cse2 .cse3)))))) is different from false [2023-09-01 14:48:26,130 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse40 (* c_~q2_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q2~0.base)) (.cse18 (+ c_~q2~0.offset .cse40))) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base)) (.cse19 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4)) (.cse15 (select .cse12 .cse18))) (let ((.cse7 (< .cse15 c_~i~0)) (.cse13 (+ .cse41 c_~q2~0.offset)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (+ c_~i~0 1)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse26 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse14 (select .cse9 .cse19)) (.cse6 (< (+ .cse15 1) c_~N~0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or (and (or .cse6 .cse7) (or (< c_~i~0 (+ c_~N~0 1)) .cse6)) .cse8 .cse5) (or (not (= (select .cse9 .cse10) c_~j~0)) .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (not (= c_~i~0 (select .cse12 .cse13))) (and (or (< .cse14 .cse2) .cse7) (or (< .cse15 .cse2) (< .cse14 c_~i~0)))) (or .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse20 c_~q1~0.base)) (.cse17 (select .cse20 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse10))) (< (select .cse17 .cse18) .cse2) (< (select .cse16 .cse19) c_~i~0) (not (= c_~i~0 (select .cse17 .cse13))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 c_~q2~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (< (select .cse22 .cse19) .cse2) (not (= c_~j~0 (select .cse22 .cse10))) (not (= c_~i~0 (select .cse21 .cse13))))))))) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse8 .cse5 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse24 .cse10) c_~j~0)) (< (select .cse25 .cse26) .cse2) (not (= (select .cse25 .cse27) c_~i~0)) (< (select .cse24 .cse19) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse10) c_~j~0)) (< (select .cse31 .cse19) .cse2) (not (= (select .cse32 .cse27) c_~i~0)) (< (select .cse32 .cse26) c_~i~0)))))))) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse35 (select .cse36 c_~q1~0.base)) (.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 .cse27) c_~i~0)) (not (= (select .cse35 .cse10) c_~j~0)) (< (select .cse35 .cse19) c_~i~0) (< (select .cse34 .cse26) .cse2))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse37 (select .cse39 c_~q1~0.base)) (.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse37 .cse19) .cse2) (not (= (select .cse38 .cse27) c_~i~0)) (not (= (select .cse37 .cse10) c_~j~0)) (< (select .cse38 .cse26) c_~i~0)))))) .cse11 .cse4 .cse8 .cse5) (or (and (or (< .cse15 c_~N~0) (< (+ .cse14 1) c_~N~0)) (or (< .cse14 c_~N~0) .cse6)) .cse8 .cse5)))))) is different from false [2023-09-01 14:48:27,840 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse40 (* c_~q2_front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~q2~0.base)) (.cse18 (+ c_~q2~0.offset .cse40))) (let ((.cse9 (select |c_#memory_int| c_~q1~0.base)) (.cse19 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse41 (* c_~q2_back~0 4)) (.cse15 (select .cse12 .cse18))) (let ((.cse7 (< .cse15 c_~i~0)) (.cse13 (+ .cse41 c_~q2~0.offset)) (.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (+ c_~i~0 1)) (.cse27 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse26 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (< c_~q1_back~0 0)) (.cse14 (select .cse9 .cse19)) (.cse6 (< (+ .cse15 1) c_~N~0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse5 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse3 .cse4 .cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_93|) 0))))) (or (and (or .cse6 .cse7) (or (< c_~i~0 (+ c_~N~0 1)) .cse6)) .cse8 .cse5) (or (not (= (select .cse9 .cse10) c_~j~0)) .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (not (= c_~i~0 (select .cse12 .cse13))) (and (or (< .cse14 .cse2) .cse7) (or (< .cse15 .cse2) (< .cse14 c_~i~0)))) (<= 1 c_~N~0) (<= c_~j~0 c_~i~0) (<= c_~j~0 c_~N~0) (or .cse0 .cse1 .cse11 .cse4 .cse8 .cse5 (and (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse16 (select .cse20 c_~q1~0.base)) (.cse17 (select .cse20 c_~q2~0.base))) (or (not (= c_~j~0 (select .cse16 .cse10))) (< (select .cse17 .cse18) .cse2) (< (select .cse16 .cse19) c_~i~0) (not (= c_~i~0 (select .cse17 .cse13))))))) (forall ((v_ArrVal_200 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 c_~q2~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (< (select .cse22 .cse19) .cse2) (not (= c_~j~0 (select .cse22 .cse10))) (not (= c_~i~0 (select .cse21 .cse13))))))))) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse8 .cse5 (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse24 .cse10) c_~j~0)) (< (select .cse25 .cse26) .cse2) (not (= (select .cse25 .cse27) c_~i~0)) (< (select .cse24 .cse19) c_~i~0))))) (forall ((v_ArrVal_197 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse29 .cse30 v_ArrVal_197)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse31 (select .cse33 c_~q1~0.base)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse10) c_~j~0)) (< (select .cse31 .cse19) .cse2) (not (= (select .cse32 .cse27) c_~i~0)) (< (select .cse32 .cse26) c_~i~0)))))))) (<= c_~N~0 c_~i~0) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse35 (select .cse36 c_~q1~0.base)) (.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse34 .cse27) c_~i~0)) (not (= (select .cse35 .cse10) c_~j~0)) (< (select .cse35 .cse19) c_~i~0) (< (select .cse34 .cse26) .cse2))))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (let ((.cse37 (select .cse39 c_~q1~0.base)) (.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse37 .cse19) .cse2) (not (= (select .cse38 .cse27) c_~i~0)) (not (= (select .cse37 .cse10) c_~j~0)) (< (select .cse38 .cse26) c_~i~0)))))) .cse11 .cse4 .cse8 .cse5) (or (and (or (< .cse15 c_~N~0) (< (+ .cse14 1) c_~N~0)) (or (< .cse14 c_~N~0) .cse6)) .cse8 .cse5) (<= c_~i~0 1) (<= 1 c_~j~0)))))) is different from false [2023-09-01 14:48:29,723 INFO L130 PetriNetUnfolder]: 521/967 cut-off events. [2023-09-01 14:48:29,723 INFO L131 PetriNetUnfolder]: For 2952/2952 co-relation queries the response was YES. [2023-09-01 14:48:29,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 967 events. 521/967 cut-off events. For 2952/2952 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4845 event pairs, 18 based on Foata normal form. 5/965 useless extension candidates. Maximal degree in co-relation 3643. Up to 299 conditions per place. [2023-09-01 14:48:29,730 INFO L137 encePairwiseOnDemand]: 318/334 looper letters, 111 selfloop transitions, 190 changer transitions 13/314 dead transitions. [2023-09-01 14:48:29,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 314 transitions, 2791 flow [2023-09-01 14:48:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-09-01 14:48:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-09-01 14:48:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 4381 transitions. [2023-09-01 14:48:29,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24748615975595978 [2023-09-01 14:48:29,744 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 4381 transitions. [2023-09-01 14:48:29,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 4381 transitions. [2023-09-01 14:48:29,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:48:29,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 4381 transitions. [2023-09-01 14:48:29,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 82.66037735849056) internal successors, (4381), 53 states have internal predecessors, (4381), 0 states have call successors, (0), 0 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:48:29,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 334.0) internal successors, (18036), 54 states have internal predecessors, (18036), 0 states have call successors, (0), 0 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:48:29,776 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 334.0) internal successors, (18036), 54 states have internal predecessors, (18036), 0 states have call successors, (0), 0 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:48:29,776 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 664 flow. Second operand 53 states and 4381 transitions. [2023-09-01 14:48:29,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 314 transitions, 2791 flow [2023-09-01 14:48:29,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 314 transitions, 2467 flow, removed 145 selfloop flow, removed 4 redundant places. [2023-09-01 14:48:29,804 INFO L231 Difference]: Finished difference. Result has 133 places, 213 transitions, 2112 flow [2023-09-01 14:48:29,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=2112, PETRI_PLACES=133, PETRI_TRANSITIONS=213} [2023-09-01 14:48:29,805 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 111 predicate places. [2023-09-01 14:48:29,805 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 213 transitions, 2112 flow [2023-09-01 14:48:29,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 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:48:29,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:48:29,806 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:48:29,813 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:48:30,012 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,SelfDestructingSolverStorable8 [2023-09-01 14:48:30,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:48:30,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:48:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1880605723, now seen corresponding path program 4 times [2023-09-01 14:48:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:48:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433931695] [2023-09-01 14:48:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:48:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:48:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:48:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:48:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:48:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433931695] [2023-09-01 14:48:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433931695] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:48:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921818885] [2023-09-01 14:48:31,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 14:48:31,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:48:31,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:48:31,029 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:48:31,060 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:48:31,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 14:48:31,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:48:31,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjunts are in the unsatisfiable core [2023-09-01 14:48:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:48:31,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:48:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:48:31,168 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 14:48:31,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 14:48:31,242 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 15 treesize of output 11 [2023-09-01 14:48:31,312 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:48:31,312 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 11 treesize of output 11 [2023-09-01 14:48:31,400 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 15 treesize of output 11 [2023-09-01 14:48:31,485 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:48:31,558 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:48:31,912 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 0 case distinctions, treesize of input 60 treesize of output 20 [2023-09-01 14:48:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:48:31,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:48:37,354 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-01 14:48:37,355 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 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-01 14:48:37,468 INFO L321 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-09-01 14:48:37,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 477 treesize of output 563 [2023-09-01 14:48:37,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:48:37,525 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 192 treesize of output 248 [2023-09-01 14:48:37,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:48:37,590 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 210 treesize of output 242 [2023-09-01 14:49:00,492 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-01 14:49:00,493 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 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-01 14:49:00,599 INFO L321 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-09-01 14:49:00,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 477 treesize of output 562 [2023-09-01 14:49:00,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:49:00,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:00,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 252 [2023-09-01 14:49:00,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:49:00,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:00,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 210 [2023-09-01 14:49:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:49:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921818885] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:49:14,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:49:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-09-01 14:49:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203413234] [2023-09-01 14:49:14,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:49:14,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:49:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:49:14,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:49:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1155, Unknown=10, NotChecked=0, Total=1332 [2023-09-01 14:49:17,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-09-01 14:49:17,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 213 transitions, 2112 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 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:49:17,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:49:17,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-09-01 14:49:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:49:22,124 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_~i~0 1))) (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse7 (<= c_~n2~0 c_~q2_back~0)) (.cse19 (* c_~q2_front~0 4)) (.cse20 (* c_~q2_back~0 4)) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse3 (< c_~q1_back~0 0)) (.cse4 (< c_~j~0 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 (let ((.cse5 (< 0 c_~q2_back~0)) (.cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|))))) (and (or (and .cse4 (= c_~q1_back~0 c_~q1_front~0)) .cse5 .cse6) (or .cse5 (= c_~q2_front~0 c_~q2_back~0) .cse6 (< c_~j~0 c_~i~0))))) (<= c_~i~0 c_~j~0) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse3 (let ((.cse9 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse10 (select .cse15 c_~q1~0.base))) (or (not (= (select .cse8 .cse9) c_~i~0)) (not (= c_~j~0 (select .cse10 .cse11))) (< (select .cse8 .cse12) .cse13) (< (select .cse10 .cse14) c_~i~0))))) (forall ((v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse17 (select .cse18 c_~q1~0.base))) (or (not (= (select .cse16 .cse9) c_~i~0)) (not (= c_~j~0 (select .cse17 .cse11))) (< (select .cse16 .cse12) c_~i~0) (< (select .cse17 .cse14) .cse13)))))))) (or .cse0 .cse1 .cse7 (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse25 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_244)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse22 (select .cse23 c_~q1~0.base)) (.cse21 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse21 (+ .cse20 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= c_~j~0 (select .cse22 .cse11))) (< (select .cse22 .cse14) c_~i~0) (< (select .cse21 (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse13))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_244 Int) (v_ArrVal_247 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 (+ .cse25 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_244)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_246) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_247))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse27 (select .cse28 c_~q1~0.base))) (or (< (select .cse26 (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~i~0 (select .cse26 (+ .cse20 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse27 .cse14) .cse13) (not (= c_~j~0 (select .cse27 .cse11))))))))) .cse2 .cse3) .cse4))) is different from false [2023-09-01 14:49:31,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:49:47,525 INFO L130 PetriNetUnfolder]: 611/1146 cut-off events. [2023-09-01 14:49:47,525 INFO L131 PetriNetUnfolder]: For 6458/6458 co-relation queries the response was YES. [2023-09-01 14:49:47,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 1146 events. 611/1146 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5980 event pairs, 30 based on Foata normal form. 12/1156 useless extension candidates. Maximal degree in co-relation 6796. Up to 464 conditions per place. [2023-09-01 14:49:47,534 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 126 selfloop transitions, 241 changer transitions 18/385 dead transitions. [2023-09-01 14:49:47,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 385 transitions, 4366 flow [2023-09-01 14:49:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-01 14:49:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-09-01 14:49:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4927 transitions. [2023-09-01 14:49:47,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24585828343313373 [2023-09-01 14:49:47,544 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4927 transitions. [2023-09-01 14:49:47,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4927 transitions. [2023-09-01 14:49:47,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:49:47,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4927 transitions. [2023-09-01 14:49:47,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 82.11666666666666) internal successors, (4927), 60 states have internal predecessors, (4927), 0 states have call successors, (0), 0 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:49:47,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 334.0) internal successors, (20374), 61 states have internal predecessors, (20374), 0 states have call successors, (0), 0 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:49:47,574 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 334.0) internal successors, (20374), 61 states have internal predecessors, (20374), 0 states have call successors, (0), 0 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:49:47,574 INFO L175 Difference]: Start difference. First operand has 133 places, 213 transitions, 2112 flow. Second operand 60 states and 4927 transitions. [2023-09-01 14:49:47,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 385 transitions, 4366 flow [2023-09-01 14:49:47,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 385 transitions, 3854 flow, removed 209 selfloop flow, removed 15 redundant places. [2023-09-01 14:49:47,621 INFO L231 Difference]: Finished difference. Result has 183 places, 274 transitions, 2908 flow [2023-09-01 14:49:47,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2908, PETRI_PLACES=183, PETRI_TRANSITIONS=274} [2023-09-01 14:49:47,622 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 161 predicate places. [2023-09-01 14:49:47,622 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 274 transitions, 2908 flow [2023-09-01 14:49:47,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 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:49:47,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:49:47,624 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:49:47,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 14:49:47,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:49:47,830 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:49:47,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:49:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 226074675, now seen corresponding path program 5 times [2023-09-01 14:49:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:49:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802594166] [2023-09-01 14:49:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:49:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:49:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:49:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:49:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:49:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802594166] [2023-09-01 14:49:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802594166] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:49:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015756249] [2023-09-01 14:49:48,846 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 14:49:48,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:49:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:49:48,848 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:49:48,850 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:49:48,949 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-09-01 14:49:48,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:49:48,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 71 conjunts are in the unsatisfiable core [2023-09-01 14:49:48,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:49:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:49:48,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:49:48,982 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 14:49:48,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 14:49:49,057 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 15 treesize of output 11 [2023-09-01 14:49:49,120 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:49:49,121 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 11 treesize of output 11 [2023-09-01 14:49:49,188 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:49:49,235 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:49:49,294 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:49:49,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:49:49,755 INFO L321 Elim1Store]: treesize reduction 77, result has 8.3 percent of original size [2023-09-01 14:49:49,755 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 54 treesize of output 26 [2023-09-01 14:49:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:49:49,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:49:51,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:51,436 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 99 treesize of output 75 [2023-09-01 14:49:51,471 INFO L321 Elim1Store]: treesize reduction 4, result has 90.7 percent of original size [2023-09-01 14:49:51,472 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 594 treesize of output 604 [2023-09-01 14:49:51,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:51,519 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 426 treesize of output 398 [2023-09-01 14:49:51,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:51,548 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 362 treesize of output 366 [2023-09-01 14:49:51,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:49:51,580 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 275 treesize of output 295 [2023-09-01 14:50:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:50:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015756249] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:50:03,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:50:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-09-01 14:50:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800302418] [2023-09-01 14:50:03,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:50:03,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:50:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:50:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:50:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1107, Unknown=11, NotChecked=0, Total=1332 [2023-09-01 14:50:04,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-09-01 14:50:04,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 274 transitions, 2908 flow. Second operand has 37 states, 37 states have (on average 80.48648648648648) internal successors, (2978), 37 states have internal predecessors, (2978), 0 states have call successors, (0), 0 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:50:04,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:50:04,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-09-01 14:50:04,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:50:12,383 WARN L222 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 178 DAG size of output: 171 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:50:12,485 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~q2_front~0 4))) (let ((.cse15 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse14 (<= c_~n2~0 c_~q2_back~0)) (.cse16 (< c_~q1_back~0 0)) (.cse17 (< c_~q2_back~0 c_~q2_front~0)) (.cse18 (< c_~q2_front~0 0)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (+ c_~i~0 1)) (.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse8 (select .cse7 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse3 (select .cse7 ~q2~0.base))) (or (not (= c_~i~0 (select .cse3 .cse4))) (< (select .cse3 .cse5) .cse6)))) (< (select .cse8 .cse9) c_~i~0) (not (= c_~j~0 (select .cse8 .cse10))))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse11 (select .cse13 c_~q1~0.base))) (or (< (select .cse11 .cse9) .cse6) (forall ((~q2~0.base Int)) (let ((.cse12 (select .cse13 ~q2~0.base))) (or (not (= c_~i~0 (select .cse12 .cse4))) (< (select .cse12 .cse5) c_~i~0)))) (not (= c_~j~0 (select .cse11 .cse10)))))))) .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (< c_~j~0 .cse6) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) .cse15 .cse16 .cse17 .cse18 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|) 0)))) (= c_~j~0 c_~i~0) (or (<= c_~q2_back~0 c_~q2_front~0) (let ((.cse20 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset .cse21)))) (let ((.cse19 (< (+ .cse20 1) c_~N~0))) (and (or .cse19 (< .cse20 c_~i~0)) (or (< c_~i~0 (+ c_~N~0 1)) .cse19)))) (<= c_~n2~0 c_~q2_front~0) .cse18) (or .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse16 .cse17 .cse18 (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse24 (select .cse23 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse22 (select .cse23 ~q2~0.base))) (or (< (select .cse22 .cse5) .cse6) (not (= c_~i~0 (select .cse22 .cse4)))))) (not (= c_~j~0 (select .cse24 .cse10))) (< (select .cse24 .cse9) c_~i~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse25 (select .cse27 c_~q1~0.base))) (or (< (select .cse25 .cse9) .cse6) (not (= c_~j~0 (select .cse25 .cse10))) (forall ((~q2~0.base Int)) (let ((.cse26 (select .cse27 ~q2~0.base))) (or (< (select .cse26 .cse5) c_~i~0) (not (= c_~i~0 (select .cse26 .cse4))))))))))))))) is different from false [2023-09-01 14:50:17,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:50:19,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:50:19,830 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q1_front~0 0)) (.cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (< c_~q1_back~0 0)) (.cse11 (< c_~q2_back~0 c_~q2_front~0)) (.cse12 (< c_~q2_front~0 0)) (.cse7 (+ c_~i~0 1)) (.cse10 (* c_~q2_back~0 4)) (.cse8 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (= c_~j~0 c_~i~0) (or .cse0 .cse1 .cse2 .cse3 (< 0 c_~q2_back~0) .cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| Int)) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97| v_ArrVal_291) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse7) (not (= (select .cse5 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~j~0)) (forall ((~q2~0.base Int)) (not (= (select (select .cse9 ~q2~0.base) .cse10) c_~i~0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_97|) 0)))) .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (<= c_~n2~0 c_~q2_back~0) .cse4 .cse11 .cse12 (let ((.cse19 (+ .cse6 c_~q1~0.offset)) (.cse18 (+ .cse8 c_~q1~0.offset)) (.cse14 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse15 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse17 (select .cse16 c_~q1~0.base))) (or (forall ((~q2~0.base Int)) (let ((.cse13 (select .cse16 ~q2~0.base))) (or (< (select .cse13 .cse14) .cse7) (not (= c_~i~0 (select .cse13 .cse15)))))) (not (= c_~j~0 (select .cse17 .cse18))) (< (select .cse17 .cse19) c_~i~0))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_293))) (let ((.cse20 (select .cse22 c_~q1~0.base))) (or (< (select .cse20 .cse19) .cse7) (not (= c_~j~0 (select .cse20 .cse18))) (forall ((~q2~0.base Int)) (let ((.cse21 (select .cse22 ~q2~0.base))) (or (< (select .cse21 .cse14) c_~i~0) (not (= c_~i~0 (select .cse21 .cse15))))))))))))))) is different from false [2023-09-01 14:50:28,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:50:42,046 WARN L222 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 210 DAG size of output: 173 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:50:54,008 WARN L222 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 213 DAG size of output: 176 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:50:56,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:51:57,986 INFO L130 PetriNetUnfolder]: 788/1455 cut-off events. [2023-09-01 14:51:57,986 INFO L131 PetriNetUnfolder]: For 9384/9384 co-relation queries the response was YES. [2023-09-01 14:51:57,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9057 conditions, 1455 events. 788/1455 cut-off events. For 9384/9384 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8023 event pairs, 30 based on Foata normal form. 13/1465 useless extension candidates. Maximal degree in co-relation 8987. Up to 448 conditions per place. [2023-09-01 14:51:57,997 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 127 selfloop transitions, 305 changer transitions 35/467 dead transitions. [2023-09-01 14:51:57,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 467 transitions, 5647 flow [2023-09-01 14:51:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-09-01 14:51:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-09-01 14:51:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 5090 transitions. [2023-09-01 14:51:58,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2498282124276038 [2023-09-01 14:51:58,007 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 5090 transitions. [2023-09-01 14:51:58,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 5090 transitions. [2023-09-01 14:51:58,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:51:58,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 5090 transitions. [2023-09-01 14:51:58,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 83.44262295081967) internal successors, (5090), 61 states have internal predecessors, (5090), 0 states have call successors, (0), 0 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:51:58,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 334.0) internal successors, (20708), 62 states have internal predecessors, (20708), 0 states have call successors, (0), 0 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:51:58,035 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 334.0) internal successors, (20708), 62 states have internal predecessors, (20708), 0 states have call successors, (0), 0 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:51:58,035 INFO L175 Difference]: Start difference. First operand has 183 places, 274 transitions, 2908 flow. Second operand 61 states and 5090 transitions. [2023-09-01 14:51:58,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 467 transitions, 5647 flow [2023-09-01 14:51:58,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 467 transitions, 5374 flow, removed 44 selfloop flow, removed 29 redundant places. [2023-09-01 14:51:58,104 INFO L231 Difference]: Finished difference. Result has 219 places, 349 transitions, 4354 flow [2023-09-01 14:51:58,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=2465, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4354, PETRI_PLACES=219, PETRI_TRANSITIONS=349} [2023-09-01 14:51:58,105 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 197 predicate places. [2023-09-01 14:51:58,105 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 349 transitions, 4354 flow [2023-09-01 14:51:58,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 80.48648648648648) internal successors, (2978), 37 states have internal predecessors, (2978), 0 states have call successors, (0), 0 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:51:58,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:51:58,106 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:51:58,114 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:51:58,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:51:58,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:51:58,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:51:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1834517005, now seen corresponding path program 6 times [2023-09-01 14:51:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:51:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809516231] [2023-09-01 14:51:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:51:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:51:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:51:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:51:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:51:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809516231] [2023-09-01 14:51:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809516231] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:51:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817644706] [2023-09-01 14:51:59,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 14:51:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:51:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:51:59,321 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:51:59,323 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:51:59,494 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 14:51:59,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:51:59,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2023-09-01 14:51:59,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:51:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,533 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-09-01 14:51:59,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-09-01 14:51:59,594 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 15 treesize of output 11 [2023-09-01 14:51:59,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:51:59,690 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-09-01 14:51:59,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 17 [2023-09-01 14:51:59,808 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 15 treesize of output 11 [2023-09-01 14:51:59,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 14:51:59,988 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:52:00,343 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 0 case distinctions, treesize of input 60 treesize of output 20 [2023-09-01 14:52:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:52:00,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:52:03,908 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-01 14:52:03,909 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 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-01 14:52:04,020 INFO L321 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-09-01 14:52:04,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 418 [2023-09-01 14:52:04,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:52:04,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:52:04,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 279 [2023-09-01 14:52:04,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:52:04,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:52:04,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 209 [2023-09-01 14:52:25,568 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-01 14:52:25,569 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 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-01 14:52:25,710 INFO L321 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-09-01 14:52:25,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 419 [2023-09-01 14:52:25,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:52:25,780 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 255 treesize of output 287 [2023-09-01 14:52:25,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:52:25,860 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 161 treesize of output 217 [2023-09-01 14:52:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:52:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817644706] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:52:54,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:52:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-09-01 14:52:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215683756] [2023-09-01 14:52:54,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:52:55,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-09-01 14:52:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:52:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-09-01 14:52:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1142, Unknown=6, NotChecked=0, Total=1332 [2023-09-01 14:52:55,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 334 [2023-09-01 14:52:55,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 349 transitions, 4354 flow. Second operand has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 0 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:52:55,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:52:55,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 334 [2023-09-01 14:52:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:53:03,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:53:05,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:53:25,480 INFO L130 PetriNetUnfolder]: 844/1572 cut-off events. [2023-09-01 14:53:25,480 INFO L131 PetriNetUnfolder]: For 16770/16770 co-relation queries the response was YES. [2023-09-01 14:53:25,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11340 conditions, 1572 events. 844/1572 cut-off events. For 16770/16770 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8873 event pairs, 26 based on Foata normal form. 7/1576 useless extension candidates. Maximal degree in co-relation 11156. Up to 489 conditions per place. [2023-09-01 14:53:25,492 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 101 selfloop transitions, 350 changer transitions 17/468 dead transitions. [2023-09-01 14:53:25,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 468 transitions, 6573 flow [2023-09-01 14:53:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-09-01 14:53:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-09-01 14:53:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3706 transitions. [2023-09-01 14:53:25,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24657351962741184 [2023-09-01 14:53:25,505 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3706 transitions. [2023-09-01 14:53:25,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3706 transitions. [2023-09-01 14:53:25,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:53:25,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3706 transitions. [2023-09-01 14:53:25,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 82.35555555555555) internal successors, (3706), 45 states have internal predecessors, (3706), 0 states have call successors, (0), 0 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:53:25,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 334.0) internal successors, (15364), 46 states have internal predecessors, (15364), 0 states have call successors, (0), 0 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:53:25,531 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 334.0) internal successors, (15364), 46 states have internal predecessors, (15364), 0 states have call successors, (0), 0 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:53:25,532 INFO L175 Difference]: Start difference. First operand has 219 places, 349 transitions, 4354 flow. Second operand 45 states and 3706 transitions. [2023-09-01 14:53:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 468 transitions, 6573 flow [2023-09-01 14:53:25,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 468 transitions, 6154 flow, removed 164 selfloop flow, removed 24 redundant places. [2023-09-01 14:53:25,638 INFO L231 Difference]: Finished difference. Result has 246 places, 391 transitions, 5636 flow [2023-09-01 14:53:25,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=4079, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=5636, PETRI_PLACES=246, PETRI_TRANSITIONS=391} [2023-09-01 14:53:25,639 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 224 predicate places. [2023-09-01 14:53:25,639 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 391 transitions, 5636 flow [2023-09-01 14:53:25,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.43243243243244) internal successors, (2939), 37 states have internal predecessors, (2939), 0 states have call successors, (0), 0 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:53:25,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:53:25,640 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:53:25,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 14:53:25,840 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,SelfDestructingSolverStorable11 [2023-09-01 14:53:25,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:53:25,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:53:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2104011777, now seen corresponding path program 7 times [2023-09-01 14:53:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:53:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951830214] [2023-09-01 14:53:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:53:25,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:53:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:53:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:53:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:53:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951830214] [2023-09-01 14:53:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951830214] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:53:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501772860] [2023-09-01 14:53:26,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 14:53:26,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:53:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:53:26,795 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:53:26,797 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:53:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:53:26,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 63 conjunts are in the unsatisfiable core [2023-09-01 14:53:26,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:53:27,053 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:53:27,113 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:53:27,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:53:27,221 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:53:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:53:27,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:53:27,763 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse0 (select (select .cse4 c_~q2~0.base) .cse5))) (or (forall ((~q1~0.base Int)) (let ((.cse1 (select .cse4 ~q1~0.base))) (or (< .cse0 (+ (select .cse1 .cse2) 1)) (not (= (select .cse1 .cse3) c_~j~0))))) (< (+ .cse0 1) c_~N~0))))) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (or (forall ((~q1~0.base Int)) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (< (select .cse6 .cse2) c_~N~0) (not (= (select .cse6 .cse3) c_~j~0))))) (< (+ (select (select .cse7 c_~q2~0.base) .cse5) 1) c_~N~0))))))) is different from false [2023-09-01 14:53:27,843 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse1 (select .cse4 ~q1~0.base)) (.cse0 (select (select .cse4 c_~q2~0.base) .cse5))) (or (< .cse0 (+ (select .cse1 .cse2) 1)) (not (= (select .cse1 .cse3) c_~j~0)) (< .cse0 c_~i~0))))) (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (< (select .cse6 .cse2) (+ c_~i~0 1)) (not (= (select .cse6 .cse3) c_~j~0)) (< (select (select .cse7 c_~q2~0.base) .cse5) c_~i~0))))))) (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) is different from false [2023-09-01 14:53:27,958 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_383))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse6 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7)) (.cse2 (select .cse6 ~q1~0.base))) (or (not (= (select .cse2 .cse3) c_~j~0)) (< .cse4 c_~i~0) (< .cse4 (+ (select .cse2 .cse5) 1))))))))) (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_383))) (or (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (not (= (select .cse8 .cse3) c_~j~0)) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7) c_~i~0) (< (select .cse8 .cse5) (+ c_~i~0 1)))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))))))))) is different from false [2023-09-01 14:53:27,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:53:27,992 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 144 treesize of output 96 [2023-09-01 14:53:28,082 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-09-01 14:53:28,083 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 1135 treesize of output 1063 [2023-09-01 14:53:28,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:53:28,160 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 489 treesize of output 503 [2023-09-01 14:53:28,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:53:28,208 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 416 treesize of output 336 [2023-09-01 14:53:53,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:53:53,434 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 118 treesize of output 82 [2023-09-01 14:53:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:53:53,465 INFO L321 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-09-01 14:53:53,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 200 [2023-09-01 14:53:53,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:53:53,476 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 132 treesize of output 108 [2023-09-01 14:53:53,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:53:53,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:53:53,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:53:53,492 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 112 [2023-09-01 14:53:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 14:53:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501772860] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:53:53,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:53:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-09-01 14:53:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755403016] [2023-09-01 14:53:53,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:53:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 14:53:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:53:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 14:53:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=866, Unknown=3, NotChecked=186, Total=1190 [2023-09-01 14:53:54,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-09-01 14:53:54,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 391 transitions, 5636 flow. Second operand has 35 states, 35 states have (on average 82.57142857142857) internal successors, (2890), 35 states have internal predecessors, (2890), 0 states have call successors, (0), 0 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:53:54,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:53:54,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-09-01 14:53:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:53:55,031 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i~0 1))) (and (<= c_~i~0 c_~j~0) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_383))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse6 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7)) (.cse2 (select .cse6 ~q1~0.base))) (or (not (= (select .cse2 .cse3) c_~j~0)) (< .cse4 c_~i~0) (< .cse4 (+ (select .cse2 .cse5) 1))))))))) (forall ((v_ArrVal_383 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_383))) (or (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (not (= (select .cse8 .cse3) c_~j~0)) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse7) c_~i~0) (< (select .cse8 .cse5) .cse10))))) (not (= c_~i~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))))))))) (< c_~j~0 .cse10))) is different from false [2023-09-01 14:53:55,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~i~0 1))) (let ((.cse9 (<= c_~n1~0 c_~q1_back~0)) (.cse10 (< c_~q2_back~0 0)) (.cse12 (< c_~j~0 .cse7)) (.cse11 (< c_~q1_back~0 0))) (and (<= c_~i~0 c_~j~0) (or (let ((.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse1 (select .cse4 ~q1~0.base)) (.cse0 (select (select .cse4 c_~q2~0.base) .cse5))) (or (< .cse0 (+ (select .cse1 .cse2) 1)) (not (= (select .cse1 .cse3) c_~j~0)) (< .cse0 c_~i~0))))) (forall ((~q1~0.base Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse6 (select .cse8 ~q1~0.base))) (or (< (select .cse6 .cse2) .cse7) (not (= (select .cse6 .cse3) c_~j~0)) (< (select (select .cse8 c_~q2~0.base) .cse5) c_~i~0))))))) .cse9 .cse10 (<= c_~n2~0 c_~q2_back~0) .cse11 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) .cse12 (or .cse9 .cse10 (and (< c_~i~0 (+ c_~j~0 1)) (= c_~q2_front~0 c_~q2_back~0) .cse12 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11)))) is different from false [2023-09-01 14:53:55,490 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse10 (< c_~j~0 (+ c_~i~0 1))) (.cse1 (< c_~q1_back~0 0))) (and (<= c_~i~0 c_~j~0) (or .cse0 .cse1 (let ((.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (let ((.cse2 (select (select .cse6 c_~q2~0.base) .cse7))) (or (forall ((~q1~0.base Int)) (let ((.cse3 (select .cse6 ~q1~0.base))) (or (< .cse2 (+ (select .cse3 .cse4) 1)) (not (= (select .cse3 .cse5) c_~j~0))))) (< (+ .cse2 1) c_~N~0))))) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_384))) (or (forall ((~q1~0.base Int)) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (< (select .cse8 .cse4) c_~N~0) (not (= (select .cse8 .cse5) c_~j~0))))) (< (+ (select (select .cse9 c_~q2~0.base) .cse7) 1) c_~N~0))))))) .cse10 (or .cse0 (< c_~q2_back~0 0) (and (< c_~i~0 (+ c_~j~0 1)) (= c_~q2_front~0 c_~q2_back~0) .cse10 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1))) is different from false [2023-09-01 14:53:57,898 INFO L130 PetriNetUnfolder]: 998/1834 cut-off events. [2023-09-01 14:53:57,898 INFO L131 PetriNetUnfolder]: For 23184/23184 co-relation queries the response was YES. [2023-09-01 14:53:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14438 conditions, 1834 events. 998/1834 cut-off events. For 23184/23184 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10640 event pairs, 63 based on Foata normal form. 3/1834 useless extension candidates. Maximal degree in co-relation 14334. Up to 919 conditions per place. [2023-09-01 14:53:57,916 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 209 selfloop transitions, 316 changer transitions 9/534 dead transitions. [2023-09-01 14:53:57,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 534 transitions, 8307 flow [2023-09-01 14:53:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-09-01 14:53:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-09-01 14:53:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3355 transitions. [2023-09-01 14:53:57,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25756179947796715 [2023-09-01 14:53:57,921 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3355 transitions. [2023-09-01 14:53:57,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3355 transitions. [2023-09-01 14:53:57,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:53:57,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3355 transitions. [2023-09-01 14:53:57,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 86.02564102564102) internal successors, (3355), 39 states have internal predecessors, (3355), 0 states have call successors, (0), 0 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:53:57,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 334.0) internal successors, (13360), 40 states have internal predecessors, (13360), 0 states have call successors, (0), 0 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:53:57,933 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 334.0) internal successors, (13360), 40 states have internal predecessors, (13360), 0 states have call successors, (0), 0 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:53:57,934 INFO L175 Difference]: Start difference. First operand has 246 places, 391 transitions, 5636 flow. Second operand 39 states and 3355 transitions. [2023-09-01 14:53:57,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 534 transitions, 8307 flow [2023-09-01 14:53:58,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 534 transitions, 7852 flow, removed 40 selfloop flow, removed 29 redundant places. [2023-09-01 14:53:58,085 INFO L231 Difference]: Finished difference. Result has 260 places, 446 transitions, 6875 flow [2023-09-01 14:53:58,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=5239, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=6875, PETRI_PLACES=260, PETRI_TRANSITIONS=446} [2023-09-01 14:53:58,086 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 238 predicate places. [2023-09-01 14:53:58,086 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 446 transitions, 6875 flow [2023-09-01 14:53:58,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 82.57142857142857) internal successors, (2890), 35 states have internal predecessors, (2890), 0 states have call successors, (0), 0 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:53:58,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:53:58,087 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:53:58,091 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:53:58,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:53:58,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:53:58,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:53:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash 131553131, now seen corresponding path program 8 times [2023-09-01 14:53:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:53:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421346361] [2023-09-01 14:53:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:53:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:53:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:53:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:53:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:53:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421346361] [2023-09-01 14:53:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421346361] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:53:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570324365] [2023-09-01 14:53:59,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 14:53:59,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:53:59,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:53:59,365 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:53:59,367 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:53:59,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 14:53:59,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:53:59,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 62 conjunts are in the unsatisfiable core [2023-09-01 14:53:59,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:53:59,704 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:53:59,769 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:53:59,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:53:59,892 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:54:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:54:00,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:54:00,291 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select (select .cse2 c_~q2~0.base) .cse3) (select .cse0 .cse4)))))) (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select .cse5 .cse4) (+ (select (select .cse6 c_~q2~0.base) .cse3) 1))))))))) is different from false [2023-09-01 14:54:00,321 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse0 (select .cse2 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select (select .cse2 c_~q2~0.base) .cse3) (select .cse0 .cse4)))))) (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select .cse5 .cse4) (+ (select (select .cse6 c_~q2~0.base) .cse3) 1)))))))) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) is different from false [2023-09-01 14:54:00,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:00,509 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 115 treesize of output 79 [2023-09-01 14:54:00,572 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-09-01 14:54:00,572 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 990 treesize of output 934 [2023-09-01 14:54:00,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:00,611 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 438 treesize of output 370 [2023-09-01 14:54:00,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:00,654 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 354 treesize of output 374 [2023-09-01 14:54:14,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:14,812 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 113 treesize of output 77 [2023-09-01 14:54:14,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:54:14,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:14,840 INFO L321 Elim1Store]: treesize reduction 23, result has 46.5 percent of original size [2023-09-01 14:54:14,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 600 treesize of output 499 [2023-09-01 14:54:14,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:14,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:14,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:14,868 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 210 [2023-09-01 14:54:14,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:14,878 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 129 treesize of output 93 [2023-09-01 14:54:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 14:54:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570324365] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:54:15,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:54:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-09-01 14:54:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781841610] [2023-09-01 14:54:15,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:54:15,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 14:54:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:54:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 14:54:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=811, Unknown=12, NotChecked=118, Total=1056 [2023-09-01 14:54:15,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 334 [2023-09-01 14:54:15,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 446 transitions, 6875 flow. Second operand has 33 states, 33 states have (on average 82.60606060606061) internal successors, (2726), 33 states have internal predecessors, (2726), 0 states have call successors, (0), 0 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:54:15,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:54:15,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 334 [2023-09-01 14:54:15,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:54:16,286 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n1~0 c_~q1_back~0)) (.cse2 (< c_~q2_back~0 0)) (.cse3 (< c_~q1_back~0 0)) (.cse0 (= c_~i~0 0)) (.cse14 (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (.cse17 (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse11 (= c_~q2_front~0 c_~q2_back~0)) (.cse15 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)) (.cse12 (= c_~q1_back~0 c_~q1_front~0)) (.cse13 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (= c_~j~0 0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) .cse0 (or .cse1 .cse2 (<= c_~n2~0 c_~q2_back~0) .cse3 (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse4 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse4 .cse5))) (<= (select (select .cse6 c_~q2~0.base) .cse7) (select .cse4 .cse8)))))) (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse5))) (< (select .cse9 .cse8) (+ (select (select .cse10 c_~q2~0.base) .cse7) 1)))))))) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or .cse1 .cse2 (and (<= c_~i~0 c_~j~0) .cse11 (< c_~j~0 (+ c_~i~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse12) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)) (<= .cse13 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~n1~0 1) (or (not .cse14) (and .cse0 .cse11 .cse15 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse12 (= c_~n1~0 1) .cse16)) (or .cse14 (and .cse17 .cse18)) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse17) .cse11 (<= c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 1) .cse15 .cse18 .cse12 (<= .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse16)) is different from false [2023-09-01 14:54:16,616 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~n1~0 c_~q1_back~0) (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_425))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse4 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse2 (select .cse4 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) (select .cse2 .cse6))))))))) (forall ((v_ArrVal_425 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_425))) (or (not (= (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_426 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (not (= c_~j~0 (select .cse8 .cse3))) (< (select .cse8 .cse6) (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 1))))))))))) (<= c_~n2~0 c_~q2_back~0) (< c_~q1_back~0 0)) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1))) is different from false [2023-09-01 14:54:19,519 INFO L130 PetriNetUnfolder]: 1199/2194 cut-off events. [2023-09-01 14:54:19,519 INFO L131 PetriNetUnfolder]: For 32817/32817 co-relation queries the response was YES. [2023-09-01 14:54:19,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18374 conditions, 2194 events. 1199/2194 cut-off events. For 32817/32817 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 13255 event pairs, 108 based on Foata normal form. 2/2192 useless extension candidates. Maximal degree in co-relation 17901. Up to 1155 conditions per place. [2023-09-01 14:54:19,540 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 271 selfloop transitions, 312 changer transitions 2/585 dead transitions. [2023-09-01 14:54:19,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 585 transitions, 9898 flow [2023-09-01 14:54:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-09-01 14:54:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-09-01 14:54:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3249 transitions. [2023-09-01 14:54:19,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2559880239520958 [2023-09-01 14:54:19,546 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3249 transitions. [2023-09-01 14:54:19,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3249 transitions. [2023-09-01 14:54:19,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:54:19,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3249 transitions. [2023-09-01 14:54:19,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.5) internal successors, (3249), 38 states have internal predecessors, (3249), 0 states have call successors, (0), 0 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:54:19,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 0 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:54:19,558 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 334.0) internal successors, (13026), 39 states have internal predecessors, (13026), 0 states have call successors, (0), 0 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:54:19,558 INFO L175 Difference]: Start difference. First operand has 260 places, 446 transitions, 6875 flow. Second operand 38 states and 3249 transitions. [2023-09-01 14:54:19,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 585 transitions, 9898 flow [2023-09-01 14:54:19,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 585 transitions, 9785 flow, removed 35 selfloop flow, removed 13 redundant places. [2023-09-01 14:54:19,771 INFO L231 Difference]: Finished difference. Result has 292 places, 509 transitions, 8760 flow [2023-09-01 14:54:19,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=6764, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8760, PETRI_PLACES=292, PETRI_TRANSITIONS=509} [2023-09-01 14:54:19,772 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 270 predicate places. [2023-09-01 14:54:19,772 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 509 transitions, 8760 flow [2023-09-01 14:54:19,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.60606060606061) internal successors, (2726), 33 states have internal predecessors, (2726), 0 states have call successors, (0), 0 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:54:19,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:54:19,773 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:54:19,778 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:54:19,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:54:19,979 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:54:19,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:54:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 595168778, now seen corresponding path program 9 times [2023-09-01 14:54:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:54:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225793018] [2023-09-01 14:54:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:54:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:54:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:54:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:54:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:54:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225793018] [2023-09-01 14:54:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225793018] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:54:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337709143] [2023-09-01 14:54:21,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 14:54:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:54:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:54:21,399 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:54:21,400 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:54:21,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 14:54:21,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:54:21,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 54 conjunts are in the unsatisfiable core [2023-09-01 14:54:21,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:54:21,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:21,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 14:54:21,651 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 14:54:21,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 14:54:21,697 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 15 treesize of output 11 [2023-09-01 14:54:21,767 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 14:54:21,767 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 11 treesize of output 11 [2023-09-01 14:54:21,812 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:54:21,823 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:54:21,875 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:54:21,918 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:54:22,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:22,104 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 60 treesize of output 40 [2023-09-01 14:54:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:54:22,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:54:23,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:23,601 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 133 treesize of output 97 [2023-09-01 14:54:23,671 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-09-01 14:54:23,671 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 1255 treesize of output 1279 [2023-09-01 14:54:23,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:23,737 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 575 treesize of output 559 [2023-09-01 14:54:23,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:23,787 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 426 treesize of output 458 [2023-09-01 14:54:23,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:54:23,878 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 330 treesize of output 386 [2023-09-01 14:56:11,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:56:11,500 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 133 treesize of output 97 [2023-09-01 14:56:11,574 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2023-09-01 14:56:11,574 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 6535 treesize of output 6302 [2023-09-01 14:56:11,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:56:11,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:56:11,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 451 [2023-09-01 14:56:11,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:56:11,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:56:11,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 379 treesize of output 427 [2023-09-01 14:56:11,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 14:56:11,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:56:11,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 401 treesize of output 377 [2023-09-01 14:56:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:56:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337709143] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 14:56:51,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 14:56:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-09-01 14:56:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42277225] [2023-09-01 14:56:51,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 14:56:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-09-01 14:56:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 14:56:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-09-01 14:56:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1194, Unknown=30, NotChecked=0, Total=1406 [2023-09-01 14:56:53,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 334 [2023-09-01 14:56:53,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 509 transitions, 8760 flow. Second operand has 38 states, 38 states have (on average 80.47368421052632) internal successors, (3058), 38 states have internal predecessors, (3058), 0 states have call successors, (0), 0 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:56:53,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 14:56:53,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 334 [2023-09-01 14:56:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 14:56:59,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:57:02,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:57:05,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:57:11,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:57:42,297 WARN L222 SmtUtils]: Spent 28.42s on a formula simplification. DAG size of input: 204 DAG size of output: 188 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:57:57,281 WARN L222 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 173 DAG size of output: 166 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:57:59,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:00,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:16,559 WARN L222 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 173 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 14:58:18,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 14:58:22,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:24,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:26,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:29,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 14:58:31,981 INFO L130 PetriNetUnfolder]: 1585/2903 cut-off events. [2023-09-01 14:58:31,981 INFO L131 PetriNetUnfolder]: For 50760/50760 co-relation queries the response was YES. [2023-09-01 14:58:31,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26117 conditions, 2903 events. 1585/2903 cut-off events. For 50760/50760 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 18597 event pairs, 56 based on Foata normal form. 15/2914 useless extension candidates. Maximal degree in co-relation 25801. Up to 1053 conditions per place. [2023-09-01 14:58:32,005 INFO L137 encePairwiseOnDemand]: 321/334 looper letters, 236 selfloop transitions, 557 changer transitions 15/808 dead transitions. [2023-09-01 14:58:32,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 808 transitions, 14614 flow [2023-09-01 14:58:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-09-01 14:58:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-09-01 14:58:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 5673 transitions. [2023-09-01 14:58:32,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2497798520605847 [2023-09-01 14:58:32,012 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 5673 transitions. [2023-09-01 14:58:32,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 5673 transitions. [2023-09-01 14:58:32,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 14:58:32,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 5673 transitions. [2023-09-01 14:58:32,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 83.42647058823529) internal successors, (5673), 68 states have internal predecessors, (5673), 0 states have call successors, (0), 0 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:58:32,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 334.0) internal successors, (23046), 69 states have internal predecessors, (23046), 0 states have call successors, (0), 0 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:58:32,036 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 334.0) internal successors, (23046), 69 states have internal predecessors, (23046), 0 states have call successors, (0), 0 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:58:32,036 INFO L175 Difference]: Start difference. First operand has 292 places, 509 transitions, 8760 flow. Second operand 68 states and 5673 transitions. [2023-09-01 14:58:32,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 808 transitions, 14614 flow [2023-09-01 14:58:32,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 808 transitions, 14433 flow, removed 38 selfloop flow, removed 21 redundant places. [2023-09-01 14:58:32,452 INFO L231 Difference]: Finished difference. Result has 351 places, 673 transitions, 13581 flow [2023-09-01 14:58:32,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=8611, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=13581, PETRI_PLACES=351, PETRI_TRANSITIONS=673} [2023-09-01 14:58:32,453 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 329 predicate places. [2023-09-01 14:58:32,453 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 673 transitions, 13581 flow [2023-09-01 14:58:32,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 80.47368421052632) internal successors, (3058), 38 states have internal predecessors, (3058), 0 states have call successors, (0), 0 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:58:32,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 14:58:32,454 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 14:58:32,460 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:58:32,659 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,SelfDestructingSolverStorable14 [2023-09-01 14:58:32,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 14:58:32,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 14:58:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -401168771, now seen corresponding path program 10 times [2023-09-01 14:58:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 14:58:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260662285] [2023-09-01 14:58:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 14:58:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 14:58:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 14:58:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 14:58:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 14:58:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260662285] [2023-09-01 14:58:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260662285] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 14:58:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459950248] [2023-09-01 14:58:34,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 14:58:34,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 14:58:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 14:58:34,328 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:58:34,329 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:58:34,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 14:58:34,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 14:58:34,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 48 conjunts are in the unsatisfiable core [2023-09-01 14:58:34,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 14:58:34,792 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-09-01 14:58:34,793 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 12 [2023-09-01 14:58:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 14:58:34,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 14:58:35,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 14:58:35,494 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 116 treesize of output 380 [2023-09-01 15:00:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 15:00:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459950248] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 15:00:00,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 15:00:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2023-09-01 15:00:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634803759] [2023-09-01 15:00:00,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 15:00:00,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 15:00:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 15:00:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 15:00:00,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2023-09-01 15:00:04,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-09-01 15:00:04,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 673 transitions, 13581 flow. Second operand has 33 states, 33 states have (on average 109.72727272727273) internal successors, (3621), 33 states have internal predecessors, (3621), 0 states have call successors, (0), 0 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 15:00:04,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 15:00:04,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-09-01 15:00:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 15:00:12,320 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 15:00:13,423 INFO L130 PetriNetUnfolder]: 1583/2959 cut-off events. [2023-09-01 15:00:13,424 INFO L131 PetriNetUnfolder]: For 66062/66062 co-relation queries the response was YES. [2023-09-01 15:00:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29380 conditions, 2959 events. 1583/2959 cut-off events. For 66062/66062 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 19387 event pairs, 104 based on Foata normal form. 86/3045 useless extension candidates. Maximal degree in co-relation 29140. Up to 1636 conditions per place. [2023-09-01 15:00:13,454 INFO L137 encePairwiseOnDemand]: 322/334 looper letters, 303 selfloop transitions, 299 changer transitions 121/723 dead transitions. [2023-09-01 15:00:13,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 723 transitions, 15502 flow [2023-09-01 15:00:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-09-01 15:00:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-09-01 15:00:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3485 transitions. [2023-09-01 15:00:13,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3365848947266757 [2023-09-01 15:00:13,459 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3485 transitions. [2023-09-01 15:00:13,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3485 transitions. [2023-09-01 15:00:13,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 15:00:13,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3485 transitions. [2023-09-01 15:00:13,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 112.41935483870968) internal successors, (3485), 31 states have internal predecessors, (3485), 0 states have call successors, (0), 0 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 15:00:13,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 0 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 15:00:13,471 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 334.0) internal successors, (10688), 32 states have internal predecessors, (10688), 0 states have call successors, (0), 0 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 15:00:13,471 INFO L175 Difference]: Start difference. First operand has 351 places, 673 transitions, 13581 flow. Second operand 31 states and 3485 transitions. [2023-09-01 15:00:13,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 723 transitions, 15502 flow [2023-09-01 15:00:14,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 723 transitions, 14244 flow, removed 380 selfloop flow, removed 22 redundant places. [2023-09-01 15:00:14,236 INFO L231 Difference]: Finished difference. Result has 360 places, 566 transitions, 10957 flow [2023-09-01 15:00:14,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=11198, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=10957, PETRI_PLACES=360, PETRI_TRANSITIONS=566} [2023-09-01 15:00:14,237 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 338 predicate places. [2023-09-01 15:00:14,237 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 566 transitions, 10957 flow [2023-09-01 15:00:14,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 109.72727272727273) internal successors, (3621), 33 states have internal predecessors, (3621), 0 states have call successors, (0), 0 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 15:00:14,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 15:00:14,237 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 15:00:14,244 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 15:00:14,438 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,SelfDestructingSolverStorable15 [2023-09-01 15:00:14,438 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 15:00:14,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 15:00:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910212, now seen corresponding path program 11 times [2023-09-01 15:00:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 15:00:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040982844] [2023-09-01 15:00:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 15:00:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 15:00:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 15:00:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 15:00:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 15:00:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040982844] [2023-09-01 15:00:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040982844] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 15:00:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772676287] [2023-09-01 15:00:16,411 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 15:00:16,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 15:00:16,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 15:00:16,413 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 15:00:16,417 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 15:00:16,523 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 15:00:16,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 15:00:16,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2023-09-01 15:00:16,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 15:00:17,066 INFO L321 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-09-01 15:00:17,067 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 60 treesize of output 43 [2023-09-01 15:00:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 15:00:17,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 15:00:17,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 15:00:17,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-09-01 15:00:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 15:00:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772676287] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 15:00:24,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 15:00:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2023-09-01 15:00:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310238132] [2023-09-01 15:00:24,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 15:00:24,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 15:00:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 15:00:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 15:00:24,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2023-09-01 15:00:27,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 334 [2023-09-01 15:00:27,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 566 transitions, 10957 flow. Second operand has 33 states, 33 states have (on average 109.66666666666667) internal successors, (3619), 33 states have internal predecessors, (3619), 0 states have call successors, (0), 0 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 15:00:27,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 15:00:27,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 334 [2023-09-01 15:00:27,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15